Menu

Question Discussion & Solution

MCQ
Q.
The entity which generate Language is termed as:

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.
Are ambiguous grammar context free?
forum Discussion
MCQ
2. 
The pushdown automation M = ({q0, q1, q2 }, {a, b}, {0, 1}, ?, q0 , 0, {q0}) with ? (q0, a, 0) = {q1 , 10} ? (q1, a, 1) = {q1 , 11} ? (q1, b, 1) = {q2 , ?} ? (q2, b, 1) = {q2 , ?} ? (q2, ?, 0) = {q0 , ?} Accepts the language
forum Discussion
MCQ
3. 
Given a Turing Machine M = ({q0, q1, q2, q3}, {a, b}, {a, b, B}, ?, B, {q3}) Where ? is a transition function defined as ?(q0, a) = (q1, a, R) ?(q1, b) = (q2, b, R) ?(q2, a) = (q2, a, R) ?(q3, b) = (q3, b, R) The language L(M) accepted by the Turing Machine is given as:
forum Discussion
MCQ
4.
If all the production rules have single non - terminal symbol on the left side, the grammar defined is:
forum Discussion
MCQ
5.
Let L = {0n1n|n ? 0} be a context free language. Which of the following is correct ?
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