Menu

Question Discussion & Solution

MCQ
Q.
Given the following two statements : A. L = {w|na(w) = nb(w)} is deterministic context free language, but not linear. B. L = {an bn} ? {an b2n} is linear, but not deterministic context free language. Which of the following options is correct ?

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.
S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of
forum Discussion
MCQ
2.
Which one of the following is FALSE?
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.
Which of the expression is appropriate?
For production p: a->b where a?V and b?_______
forum Discussion
MCQ
5.
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

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