Language $L_1$ is defined by the grammar: $S_1 → aS_1b|ε$ Language $L_2$…

GATE · 2016 · CS · Set 2 · Computer Science & IT

Language $L_1$ is defined by the grammar: $S_1 → aS_1b|ε$

Language $L_2$ is defined by the grammar: $S_2 → abS_2|ε$

Consider the following statements:

$P$ : $L_1$ is regular

$Q$ : $L_2$ is regular

Which one of the following is TRUE?

Attempted by 232 students.

Language \(L_1\) is defined by the grammar: \(S_1 → aS_1b|ε\) Language \(L_2\)…