GATE CS 2016 Set 1 — Question 19

Multiple choice 1 mark Question 19 2016

Question 19

MCQ 1 marks · −0.33 Theory of Computation

Language \(L_1\) is defined by the grammar: \(S_1 \rightarrow a S_1 b \mid \varepsilon\)

Language \(L_2\) is defined by the grammar: \(S_2 \rightarrow ab S_2 \mid \varepsilon\)

Consider the following statements:

P: \(L_1\) is regular
Q: \(L_2\) is regular

Which one of the following is TRUE?

A Both P and Q are true B P is true and Q is false C P is false and Q is true D Both P and Q are false

Answers and explanations are free — they just need an account.

GATE CS — Computer Science & IT 2016 Theory of Computation

Source: GATE 2016 Computer Science and Information Technology, Set 1, Q19 (question number approximate)