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.
Asked
Active
Viewed 2,117 times
2
TheMathNoob
- 2,101
-
There would have to be two states. – Math1000 Jan 28 '17 at 06:31
-
I updated my answer. I think there has to be two states for the language of just the empty string. – TheMathNoob Jan 28 '17 at 06:33
-
1Your DFA is correct – Samasambo Jan 28 '17 at 06:52
-
Any number of states works, as long as none of them is an accepting state. – MJD Jan 28 '17 at 07:21
-
"The language of just the empty string" is how I interpreted "the language of the empty set." – Math1000 Jan 28 '17 at 22:45