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

Given a Turing Machine
M = ({q₀, q₁, q₂, q₃}, {a, b}, {a, b, B}, δ, B, {q₃})
Where δ is a transition function defined as
δ(q₀, a) = (q₁, a, R)
δ(q₁, b) = (q₂, b, R)
δ(q₂, a) = (q₂, a, R)
δ(q₃, b) = (q₃, 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:
δ(q₀, a) = (q₁, a, R)
δ(q₁, b) = (q₂, b, R)
δ(q₂, a) = (q₂, a, R)
δ(q₃, b) = (q₃, b, R)
We can draw a DFA:

Language will be aba*b.
So, option (C) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up

Save