July2016 cs Q57

0. 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:

Answer
Comment
Array

Option : C
Explanation :
According to given question, we have transtion: δ(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.

Forgot your password?

I agree with the Terms.