The language L = { 0ⁱ 2 1ⁱ | i ≥ 0 } over the alphabet {0,1,2} is
PYQ GATE 2007
The language L = { 0ⁱ 2 1ⁱ | i ≥ 0 } over the alphabet {0,1,2} is
- A.
not recursive
- B.
is recursive and is a deterministic CFL
- C.
is a regular language
- D.
is not a deterministic CFL but a CFL
Attempted by 236 students.
Sign up free to check your answer
Sign up freeLoading lesson…

