Menu

Question Discussion & Solution

MCQ
Q.
The context free grammar given by S ? XYX X ? aX|bX|? Y ? bbb generates the language which is defined by regular expression:

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.
Consider the languages L1 = ? and L2 = {1}. Which one of the following represents L*1? L*1 L*2 ?
forum Discussion
MCQ
2.
For S->0S1|e for ?={0,1}*, which of the following is wrong for the language produced?
forum Discussion
MCQ
3.
Consider the following grammar.
S -> AB
A -> a
A -> BaB
B -> bbA
Which of the following statements is FALSE?
forum Discussion
MCQ
4.
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 Discussion
MCQ
5.

Which of these languages are not context free

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