I have practiced DFA's for an upcoming test and I haven't been able to grasp how to construct more difficult DFA's. An example would be this question : Construct a deterministic finite state automata that recognizes the set of bit strings not containing 010 (With three states).
Asked
Active
Viewed 15 times
