Multiple Choice
The language L = { 0^i 2 1 ^i i>-0 } over the alphabet (0,1,2) is
A) not recurcise
B) is recursive and deterministic CFL
C) is a regular language
D) is not a deterministic CFL but a CFL
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q15: Definition of a language L with alphabet
Q16: Let L<sub>1</sub> be a regular language, L<sub>2</sub>
Q17: Consider the regular language L =(111+11111)*. The
Q18: Consider the languages: GATE[2005]L<sub>1</sub> = {wwR w
Q19: Which of the following problems are decidable?<br>1)
Q20: Which of the following languages is regular?<br>A){WW^R
Q21: Let L = L<sub>1</sub> \cap L<sub>2</sub>, where
Q22: Consider the following Finite State Automaton The
Q23: Let L={w \in (0 + 1)*|w has
Q24: Let w be any string of length