Question 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.
A
1
B
2
C
3
D
4
richa sarma
0 0 votes
Article Rating
Subscribe
Notify of


0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: <b>Alert: </b>Content selection is disabled!!
Question 8178 – GATE 2015 [Set-1]
February 4, 2024
Question 8185 – GATE 2015 [Set-1]
February 4, 2024
Question 8178 – GATE 2015 [Set-1]
February 4, 2024
Question 8185 – GATE 2015 [Set-1]
February 4, 2024