Menu

Question Discussion & Solution

MCQ
Q. 
The language {am bn Cm+n | m, n ? 1} 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.
The set A={ 0n 1n 2 n | n=1, 2, 3, ......... } is an example of a grammar that is:
forum Discussion
MCQ
2. 
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
3.
The language L= {0i21i | i?0 } over the alphabet {0,1, 2} is:
forum Discussion
MCQ
4.
Consider the language L = { an ? n?0 }?{ anbn ? n?0 } and the following statements.I. L is deterministic context-free.II. L is context-free but not deterIII. L is not LL(k) for any k.Which of the above statements is/are TRUE ?
forum Discussion
MCQ
5.
Production Rule: aAb->agb belongs to which of the following category?
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