GATE 2017 [Set-1]
April 20, 2024Question 8053 – Theory-of-Computation
April 20, 2024Question 7918 – Theory-of-Computation
Consider the language L given by the regular expression (a+b)*b(a+b) over the alphabet {a,b}. The smallest number of states needed in deterministic finite-state automation (DFA) accepting L is _________.
Correct Answer: A
Question 12 Explanation:
The NFA for regular expression: (a+b)*b(a+b)
After converting the NFA into DFA:
After converting the NFA into DFA:
After converting the NFA into DFA:
After converting the NFA into DFA:
4
5
6
7