Theory of Computation : Non-deterministic finite state automaton
Give a non-deterministic finite state automaton that recognizes the language L subset {0,1}* that consists of all words w such that some appearance of two 0's in w is separated by an even number of 1's. (For example: the words 0010010110, 001101 are in the language but the words 0101110, 001001 are not.) (As a note, this i
