Multiple Choice
Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of the following statements is false?
A) L1 n L2 is a deterministic CFL
B) L3 n L1 is recursive
C) L1 U L2 is context free
D) L1 n L2 n L3 is recursively enumerable
Correct Answer:
Verified
Correct Answer:
Verified
Q11: Consider the language L<sub>1</sub>,L<sub>2</sub>,L<sub>3</sub> as given below.<br>L<sub>1</sub>={0^{p}1^{q}
Q12: Consider the following statements about the context
Q13: The minimum state automaton equivalent to the
Q14: Let L<sub>1</sub> be a recursive language, and
Q15: Definition of a language L with alphabet
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