Construct a DFA that accepts the language of the empty set. The alphabet is 0 and 1. I think it is just one state with no accept states and one arrow with both inputs.
Is it possible to construct a DFA that accepts the language of the empty set?
2
$\begingroup$
automata
-
0There would have to be two states. – 2017-01-28
-
0I updated my answer. I think there has to be two states for the language of just the empty string. – 2017-01-28
-
1Your DFA is correct – 2017-01-28
-
0Any number of states works, as long as none of them is an accepting state. – 2017-01-28
-
0"The language of just the empty string" is how I interpreted "the language of the empty set." – 2017-01-28