go to previous page   go to home page   go to next page

Answer:

automaton

Even More Practice

Here is another automaton:

automaton

QUESTION 29:

Label the automaton so that it accepts strings of 1 and 0 that have at least one pair of successive 0 or at least one pair of successive 1. Here are some examples:

00 11 100 011 0110 0010 1100 0110100 1010110010 010101000101