Deterministic Finite-state Machine that accepts empty set?

Question

For my Computer Science class I need to develope a machine that accepts the empty set as a language. I'm not looking for the answer, but perhaps a tip to head me in the right direction? I've been pondering this for a while now and I just cannot see how a machine can take no input. Thanks.

Answer 1

You create a storage area that can accept input. Since you are making a 'language,' call this a dictionary. You can then create a routine to add 'words' into the dictionary. Allow the number of entries to equal zero, & you have an empty set.

Answer 2

(m) interior the assumption of computation, a deterministic finite state gadget or deterministic finite automaton (DFA) is a finite state gadget the place for each pair of state and enter image there is one and easily one transition to a next state. DFAs know the set of general languages and no different languages. A DFA will soak up a string of enter symbols. for each enter image it is going to then transition to a state given via following a transition function. while the final enter image has gained it is going to the two settle for or reject the string based on no count if that's in an accepting state or no longer. right here occasion is of a DFA M, with a binary alphabet, which determines if the enter consists of a good form of 0s. M = (S, ?, T, s, A) the place ? = {0, one million}, S = {S1, S2}, s = S1, A = {S1}, and T is defined via right here state transition table: 0 one million S1 S2 S1 S2 S1 S2 The state diagram for M is: purely positioned, the state S1 represents that there has been a good form of 0s interior the enter so a techniques, on a similar time as S2 shows a wierd variety. A one million interior the enter does not substitute the state of the automaton. while the enter ends, the state will instruct no count if the enter contained a good form of 0s or no longer. The language of M might nicely be defined via the general language given via this general expression:

Answer 3

The answer lies in truly understanding the question. More specifically, understanding what the concepts of 'deterministic' and 'finite-state' --really-- mean in terms of a machine.

When you see it, you're gonna blow an αss-gasket ☺

Doug