Question 8259 – Theory-of-Computation
May 17, 2024Question 8003 – Theory-of-Computation
May 17, 2024Question 8413 – Theory-of-Computation
Let L be the language represented by the regular expression Σ*0011Σ* where Σ = {0,1}. What is the minimum number of states in a DFA that recognizes 
(complement of L)?
Correct Answer: B
Question 30 Explanation:
No. of states in DFA accepting L and complement of L is same. So let’s draw minimal DFA for L,
So, 5 states are there.
So, 5 states are there.
4
5
6
8
Subscribe
Login
0 Comments