The following Finite Automaton recognizes which of the given languages? Fig.
2014
The following Finite Automaton recognizes which of the given languages?
Fig.
- A.
{1, 0}* {01}
- B.
{1, 0}* {1}
- C.
{1}{1, 0}* {1}
- D.
1*0* {0, 1}
Attempted by 107 students.
Show answer & explanation
Correct answer: A
The Finite Automaton has start state A and final state C. To accept a string, the machine must end in state C. State C is reached only from state B via an input of '1'. To be in state B, the machine must have just processed a '0' (transitioning from A or C). Therefore, any string accepted by this automaton must end with the sequence '01'. This corresponds to the language of all strings over {0, 1} ending in '01'.