No discussions yet. Be the first to start!
You must be logged in to participate in the discussion.
login Login to DiscussL1 = {a^{m}b^{m}ca^{n}b^{n} | m, n >= 0 }
L2 = {a^{i}b^{j}c^{k} | i, j, k >= 0 }
Then L isLet G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A ? v, with |v| = K > 1. The derivation tree for any W ? L(G) has a height h such thatS -> AB
A -> aAb|?
B -> bB| b | 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) |