Menu

Question Discussion & Solution

MCQ
Q.
Consider the languages L1 = {0i1j | i != j}. L2 = {0i1j | i = j}. L3 = {0i1j | i = 2j+1}. L4 = {0i1j | i != 2j}.

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 language L = {aib ci ? i >= 0} over the alphabet {a, b, c} is:
forum Discussion
MCQ
2. 
Let G = ({S}, {a, b} R, S) be a context free grammar where the rule set R is S ? a S b | SS | ? Which of the following statements is true?
forum Discussion
MCQ
3.
Match the following:

forum Discussion
MCQ
4. 
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
5.
Are ambiguous grammar context free?
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