recategorized by
8,168 views
1 votes
1 votes

Given a Turing Machine

$M=(\{q_0, q_1, q_2, q_3\}, \{a,b\}, \{a, b, B\}, \delta, B, \{q_3\})$

where $\delta$ is a atransaction function defined as

$\delta(q_0,a)=(q_1, a, R)$

$\delta(q_1, b)=(q_2, b, R)$

$\delta(q_2, a)=(q_2, a, R)$

$\delta(q_2,b)=(q_3, b, R)$

The language L(M) accepted by the Turing machine is given as:

  1. aa*b
  2. abab
  3. aba*b
  4. aba*
recategorized by

3 Answers

Best answer
5 votes
5 votes
Turing machine head movement only right direction...

We can build dfa for it..

Total 4 states are given ...

(q0,a) gives q1 no transition for b

(q1,b) gives q2 no transition for a

That means string start with ab

Now ..(q2,a) gives q2 that means it is loop on q2...

From (q2,b) go to q3 and after that no transition... That means string end with" b"

So C. Is right ans.
selected by
0 votes
0 votes

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

Answer:

Related questions