Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* ∪ L1* ?
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2013 · Q8
Time
Select one answerSingle correct
Solution
Official answer: A) { }
Regular Expressions and Finite AutomataGiven the languages:
Now, compute each component:
The concatenation of the empty set with any language is :
The Kleene star of the empty language contains only the empty string:
Combining the two via union:
Hence, (A) is the correct option.
Try the question first, then check your work.
Examiner trap
Recall that concatenating any language with yields , while the Kleene closure of is .
This Regular Expressions and Finite Automata previous year question is Q8 of the GATE CSE 2013 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 2013 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.