GATE | Gate IT 2007 | Question 50

Consider the following finite automata P and Q over the alphabet {a, b, c}. The start states are indicated by a double arrow and final states are indicated by a double circle. Let the languages recognized by them be denoted by L(P) and L(Q) respectively.

2007_50

The automation which recognizes the language L(P) ∩ L(Q) is :
2007_50_a
2007_50_b
2007_50_c
2007_50_d



(A) a
(B) b
(C) c
(D) d


Answer: (A)

Explanation: Both accepts strings starting with a or b so option D cancels out.
In P(L) after c both a and b could be accepted, but in Q(L) only a could be accepted. Option C drops out here,
In P(L) aa could be accepted, but in Q(L) aa could not be accepted. Option B drops out here,


Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.