Consider the DFAs M and N given above. The number of states in a minimal DFA…

GATE · 2015 · CS · Set 1 · Computer Science & IT

Consider the DFAs M and N given above. The number of states in a minimal DFA that accepts the language L(M) ∩ L(N) is____________________

Attempted by 247 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…