Let L be the set of all binary strings whose last two symbols are the same. The number of states in the minimum state deterministic finite state automaton accepting L is
Open in App
Solution
The number of states in the minimum state deterministic finite state automation accepting all binary strings whose last two symbols are the same is 5.