Question 8001 – Theory-of-Computation
May 17, 2024Question 8413 – Theory-of-Computation
May 17, 2024Question 8259 – Theory-of-Computation
The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1) * (10) is __________.
Correct Answer: A
Question 29 Explanation:
No. of states in minimal DFA is 3.
3
4
5
6
Subscribe
Login
0 Comments