Question 9973 – Theory-of-Computation
December 6, 2023Question 10017 – Theory-of-Computation
December 6, 2023Question 9991 – Theory-of-Computation
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
Correct Answer: B
Question 29 Explanation:
NFA:
Equivalent DFA:
Hence, 5 states.
2
5
8
3
Subscribe
Login
0 Comments