Timeline for 5-state DFA that recognizes only the string 00001111
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 19, 2017 at 16:15 | comment | added | zfza | The definition of a DFA I use here is that every state must have an exiting transition for every symbol of the alphabet, so the above DFA would not be valid. I will edit the original question. | |
| Apr 19, 2017 at 7:37 | history | answered | Mike B. | CC BY-SA 3.0 |