Aptitude | GATE CS 1998 | Question 40

Let L be the set of all binary strings whose last two symbols are same. The number of states in the minimal state deterministic finite-state automaton accepting L is
(A) 2
(B) 5
(C) 8
(D) 3


Answer: (B)

Explanation: Last two symbols of a binary string should be either 11 or 00. So it will be having 5 states.

Quiz of this Question