Menu

Question Discussion & Solution

MCQ
Q.
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 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.
Consider the following grammar.
S -> AB
A -> a
A -> BaB
B -> bbA
Which of the following statements is FALSE?
forum Discussion
MCQ
2.
Match the following:

List - IList - II
(a) Context free grammar(i)Linear bounded automaton
(b) Regular grammar(ii) Pushdown automaton
(c)Context sensitive grammar(iii) Turing machine
(d)Unrestricted grammar(iv)Deterministic finite automaton
codes:

 (a)(b)(c)(d)
(A)(ii)(iv)(iii)(i)
(B)(ii)(iv)(i)(iii)
(C)(iv)(i)(ii)(iii)
(4)(i)(iv)(iii(ii)
forum Discussion
MCQ
3.
Given the following two languages : L1 = {an bn | n ? 0, n ? 100} L2 = {w ? {a, b, c}*| na(w) = nb(w) = nc(w)} Which of the following options is correct ?
forum Discussion
MCQ
4.
Which of the following are context free?

A = {anbnambm | m, n>=0}
B = {ambnambn | m, n>=0}
C = {ambn | m?2n,m, n>=0}
forum Discussion
MCQ
5.
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

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
article

Finite Automata

format_list_bulleted 44 MCQs
article

Context Free Grammars

format_list_bulleted 76 MCQs
article

Push Down Automata

format_list_bulleted 37 MCQs
article

Regular and context free languages

format_list_bulleted 65 MCQs
article

Pumping Lemma

format_list_bulleted 14 MCQs
article

Turning Machine

format_list_bulleted 14 MCQs