If L1 = {an n ≥ 0} and L2 = {bn n ≥ 0}, consider (I) L1 · L2 is a regular language (II) L1 · L2 = {an bn n ≥ 0} Which one of the following is CORRECT?
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2014 Set 2 · Q15
Time
Select one answerSingle correct
Solution
Official answer: A) Only (I)
Regular Expressions and Finite AutomataGiven:
is a regular language.
is a regular language.
Evaluating the statements:
Statement (I): The concatenation of two regular languages is always regular (closure property). Here, , which is regular. Thus, statement (I) is TRUE.
Statement (II): By definition of concatenation of languages:
The powers of and are chosen independently. Hence, . Thus, statement (II) is FALSE.
Therefore, Only (I) is correct, which corresponds to option (A).
Try the question first, then check your work.
Examiner trap
Check whether regular languages are closed under concatenation, and consider whether concatenation forces equal numbers of 's and 's.
This Regular Expressions and Finite Automata previous year question is Q15 of the GATE CSE 2014 Set 2 paper. Find more GATE CSE PYQs on Regular Expressions and Finite Automata in Theory of Computation, or browse all GATE CSE PYQs.
Free diagnostic
Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related Regular Expressions and Finite Automata PYQs now with no account.
An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.
Regular Expressions and Finite Automata has 41 GATE CSE PYQs across 24 papers from 2011 to 2026. 14 of them are 1-mark MCQs like this one, and GATE CSE 2014 Set 2 has 2.
How GATE tests Regular Expressions and Finite AutomataIndependent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.