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?
- 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
Attempted by 219 students.
Show answer
Correct answer: C
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…