Exam 1

1. Question

   Consider the following automaton with initial state A and accepting state B:
   

   Which of the following sequences are accepted?

   
   
   1. 1010011
   2. 01011
   3. 00100
   4. 1101
   5. 111110
   
   

   Solution

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

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