GATE 1998
December 6, 2023Theory-of-Computation
December 6, 2023GATE 1998
|
Question 40
|
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 0 state automaton accepting L is
|
2
|
|
|
5
|
|
|
8
|
|
|
3
|
Question 40 Explanation:
NFA:
Equivalent DFA:
Hence, 5 states.
Correct Answer: B
Question 40 Explanation:
NFA:
Equivalent DFA:
Hence, 5 states.