![Question 8184 – GATE 2015 [Set-1]](https://solutionsadda.in/wp-content/uploads/2019/05/green-new-logo.png){kind=logo}
Question 8178 – GATE 2015 [Set-1]
February 4, 2024Question 8185 – GATE 2015 [Set-1]
February 4, 2024Question 8184 – GATE 2015 [Set-1]
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 __________.
Correct Answer: A
Question 27 Explanation:
M accepts the strings which end with a and N accepts the strings which end with B. Their intersection should accept empty language.
1
2
3
4