Consider the language L1,L2,L3 as given below. L1={0^{p}1^{q}

Turing machine can be used to recognize all the three languages

Push Down Automata (PDA) can be used to recognize L1 and L2

All the three languages are context free

1.	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
Answer» D. Turing machine can be used to recognize all the three languages

Discussion

No Comment Found

Related MCQs

Consider the translation scheme shown belowS → T RR → + T {print ('+');} R | εT → num {print (num.val);}Here num is a token that represents an integer and num.val represents thecorresponding integer value. For an input string '9 + 5 + 2', this translation scheme willprint
Consider the following two statements:S1: { 0^2n |n >= l} is a regu1ar languageS2: { 0^m 0^n 0^(m+n) l m >= 1 and n >= 2} is a regu1ar languageWhich of the following statements is correct?
Consider the intermediate code given below:1. i = 12. j = 13. t1 = 5 * i4. t2 = t1 + j5. t3 = 4 * t26. t4 = t37. a[t4] = –18. j = j + 19. if j
Consider the following statements about the context free grammarG = {S - >SS, S - >ab, S - >ba, S - ε}I. G is ambiguousII. G produces all strings with equal number of a’s and b’sIII. G can be accepted by a deterministic PDA.Which combination below expresses all the true statements about G?
The expression (a*b)* c op........ where 'op' is one of '+', '*' and '↑' (exponentiation) can be evaluated on a CPU with a single register without storing the value of (a * b) if
For S € (0+1)* let d(s)denote the decimal value of s(e.g.d(101)= 5).Let L = {s € (0 + 1) | d (s) mod 5 = 2 and d (s) mod 7 != 4)}Which one of the following statements is true?
Consider the following statements related to compiler construction : I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct?
Consider the following two problems on undirected graphs:α: Given G(V,E), does G have an independent set of size |v|—4?β: Given G(V,E), does G have an independent set of size 5?Which one of the following is TRUE?
Consider the regular language L =(111+11111)*. The minimum number of states
Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between n1 and n2 is:

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?

Discussion

No Comment Found

Related MCQs

Reply to Comment