Menu

Question Discussion & Solution

MCQ
Q.
To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:

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.
A DPDA is a PDA in which:
forum Discussion
MCQ
2.
Which of the following is a simulator for non deterministic automata?
forum Discussion
MCQ
3.
Push down automata accepts which language?
forum Discussion
MCQ
4.
PDA can be represented with the help of
forum Discussion
MCQ
5.
A PDA machine configuration (p, w, y) can be correctly represented as:
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