Exam 1

  1. Question

    Consider the following automaton with initial state A and accepting state D:
    automaton.png
    Which of the following sequences are accepted?

    1. 101000
    2. 00000
    3. 10100
    4. 0000110
    5. 00111

    Solution

    The given automaton accepts input strings which consist of an odd number of ones and odd number of zeros.

    1. Not accepted
    2. Not accepted
    3. Not accepted
    4. Not accepted
    5. Not accepted