Menu

Question Discussion & Solution

MCQ
Q.
Which of these does not belong to CFG?

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.
Recursively enumerable languages are not closed under ______________
forum Discussion
MCQ
2.
A CFG(Context Free Grammar) is said to be in Chomsky Normal Form (CNF), if all the productions are of the form A -> BC or A -> a. Let G be a CFG in CNF. To derive a string of terminals of length x, the number of products to be used is
forum Discussion
MCQ
3.
Consider the following context-free grammar over the alphabet ? = {a, b} with S as the start symbol:
S ? AT 
A ? aAa | bAb | #T 
T ? aT | bT | ?
Which of the following represents the language generated by the above grammar?
forum Discussion
MCQ
4.
Which among the following is the missing transition in the given DFA?
L= {x??= {a, b} | x starts with a and ends with b}

forum Discussion
MCQ
5.
Push down automata excepts which language ?
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