Menu

Question Discussion & Solution

MCQ
Q. 
 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?

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
Which of the expression is appropriate?
For production p: a->b where a?V and b?_______
forum Discussion
MCQ
2.
The following Context-Free Grammar (CFG): S ? aB | bA A ? a | aS | bAA B ? b | bS | aBB will generate (1) odd numbers of a
forum Discussion
MCQ
3. 
The pushdown automation M = ({q0, q1, q2 }, {a, b}, {0, 1}, ?, q0 , 0, {q0}) with ? (q0, a, 0) = {q1 , 10} ? (q1, a, 1) = {q1 , 11} ? (q1, b, 1) = {q2 , ?} ? (q2, b, 1) = {q2 , ?} ? (q2, ?, 0) = {q0 , ?} Accepts the language
forum Discussion
MCQ
4.
Consider the CFG with {S,A,B) as the non-terminal alphabet, {a,b) as the terminal alphabet, S as the start symbol and the following set of production rules

S --> aB        S --> bA
B --> b         A --> a
B --> bS        A --> aS
B --> aBB       A --> bAA
Which of the following strings is generated by the grammar?
forum Discussion
MCQ
5.
Let L = {0n1n|n ? 0} be a context free language. Which of the following is correct ?
forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
Practice arrow_forward
article

Finite Automata

format_list_bulleted 44 MCQs
Practice arrow_forward
article

Context Free Grammars

format_list_bulleted 76 MCQs
Practice arrow_forward
article

Push Down Automata

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Regular and context free languages

format_list_bulleted 65 MCQs
Practice arrow_forward
article

Pumping Lemma

format_list_bulleted 14 MCQs
Practice arrow_forward
article

Turning Machine

format_list_bulleted 14 MCQs
Practice arrow_forward