Skip to content
Related Articles

Related Articles

Save Article
Improve Article
Save Article
Like Article

UGC-NET | UGC NET CS 2016 July – III | Question 57

  • Last Updated : 06 Sep, 2021

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:
(A) aa*b
(B) abab
(C) aba*b
(D) aba*


Answer: (C)

Explanation: According to given question, we have transition:
δ(q0, a) = (q1, a, R)
δ(q1, b) = (q2, b, R)
δ(q2, a) = (q2, a, R)
δ(q3, b) = (q3, b, R)
We can draw a DFA:
57
Language will be aba*b.
So, option (C) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :