Menu

Question Discussion & Solution

MCQ
Q.
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 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.
The language L= {0i21i | i?0 } over the alphabet {0,1, 2} is:
forum Discussion
MCQ
2. 
The language {am bn Cm+n | m, n ? 1} is
forum Discussion
MCQ
3.
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
4.
The minimum number of productions required to produce a language consisting of palindrome strings over ?={a,b} is
forum Discussion
MCQ
5.
Consider the following grammar.
S -> AB
A -> a
A -> BaB
B -> bbA
Which of the following statements is FALSE?
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