GATE | CS | 2016 | Set 2 | TOC | Finite Automata | Question 27

Last Updated :
Discuss
Comments
Language L1 is defined by the grammar: S1 -> aS1b | ε
Language L2 is defined by the grammar: S2 -> abS2 | ε

Consider the following statements: 

P: L1 is regular
Q: L2 is regular

Which one of the following is TRUE?

Both P and Q are true

P is true and Q is false

P is false and Q is true

Both P and Q are false

This question is part of this quiz :

GATE-CS-2016 (Set 2),Finite Automata PYQ QUIZ GATE CS
Tags:
GATE
Theory of Computation
Share your thoughts in the comments