Multiple Choice
Consider the language L1,L2,L3 as given below.
L1={0^{p}1^{q} | p,q \in N}
L2={0^{p}1^{q} | p,q \in N and p=q} L3={0^{p}1^{q}1^{r} | p,q,r \in N and p=q=r}
Which of the following statements is NOT TRUE?
A) Push Down Automata (PDA) can be used to recognize L1 and L2
B) L1 is a regular language
C) All the three languages are context free
D) Turing machine can be used to recognize all the three languages
Correct Answer:

Verified
Correct Answer:
Verified
Q6: A minimum state deterministic finite automation accepting
Q7: If s is a string over (0
Q8: Consider the following two problems on undirected
Q9: Consider the set of strings on
Q10: For S € (0+1)* let d(s)denote the
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
Q16: Let L<sub>1</sub> be a regular language, L<sub>2</sub>