-
The language L = { 0p 2 1i | i ≥ 0 } over the alphabet {0, 1, 2} is
-
- not recursive
- is recursive and is a deterministic CFL
- is a regular language
- is not a deterministic CFL but a CFL
- not recursive
Correct Option: B
L = { 0i 2li | i > 0 }, this language can't be accepted by DFA to regular, but it is recursive & can be accepted by PDA to CFL.
