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.
Which one of the following is FALSE?
forum Discussion
MCQ
2.
The minimum number of productions required to produce a language consisting of palindrome strings over ?={a,b} is
forum Discussion
MCQ
3.
Context sensitive language can be recognized by a :
forum Discussion
MCQ
4. 
Let P be a regular language and Q be context-free language such that Q 	\subseteq P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn|n \in N}). Then which of the following is ALWAYS regular?
forum Discussion
MCQ
5.
Which of the following pairs have DIFFERENT expressive power?
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