Skip to content
Related Articles

Related Articles

Improve Article

GATE | Gate IT 2007 | Question 50

  • Last Updated : 30 Sep, 2020

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.


The automation which recognizes the language L(P) ∩ L(Q) is :

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

Answer: (A)

Explanation: Both accepts strings starting with a or b so option (D) cancels out.

Common string accept by both L(P) and L(Q) is “baa”.

Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :