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 languages:
L1 = {wwR |w ? {0, 1}*}
L2 = {w#wR | w ? {0, 1}*}, where # is a special symbol
L3 = {ww |  w ?  (0, 1}*)
 Which one of the following is TRUE?
forum Discussion
MCQ
2.
Consider the languages L1 = ? and L2 = {1}. Which one of the following represents L*1? L*1 L*2 ?
forum Discussion
MCQ
3.
Which of the following statement is false?
forum Discussion
MCQ
4.
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
5.
The language of all non-null strings of a
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