No discussions yet. Be the first to start!
You must be logged in to participate in the discussion.
login Login to Discuss
L1 = {a^{m}b^{m}ca^{n}b^{n} | m, n >= 0 }
L2 = {a^{i}b^{j}c^{k} | i, j, k >= 0 }
Then L is| List - I | List - II |
| (a) Context free grammar | (i)Linear bounded automaton |
| (b) Regular grammar | (ii) Pushdown automaton |
| (c)Context sensitive grammar | (iii) Turing machine |
| (d)Unrestricted grammar | (iv)Deterministic finite automaton |
| (a) | (b) | (c) | (d) | |
| (A) | (ii) | (iv) | (iii) | (i) |
| (B) | (ii) | (iv) | (i) | (iii) |
| (C) | (iv) | (i) | (ii) | (iii) |
| (4) | (i) | (iv) | (iii | (ii) |
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}0^{r} | p,q,r \in N and p=q=r} Which of the following statements is NOT TRUE?