Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

1 . Consider the Turing machine, M , shown below. ( Grafstate code for this machine is at the end of the . tex document

1. Consider the Turing machine, M, shown below.
(Grafstate code for this machine is at the end of the .tex document)
(a)7 points Show the computation of the string abac in this machine.
Note, abac epsilon in L(M).
q_0abac |-$q_1bac
|-
b)8 points Show the computation of the string accba in M. Note,
accba exculed from L(M).
q_0accba |-$q_1ccba
|-
(c)8 points What is L(M)?
Fig 1 grafstate code
:+ tm TM1
title Problem 1
Q={q0,q1,q2,q3,q4,q5,q6,q7,qa,qr};
S={a,b,c};
T={a,b,c,\_,X,$};
q0=q0;
q0->q1: a->$,R;
q0->qr: b->b,R;
q0->qr: c->c,R;
q0->qr: \_->\_,R;
q1->q1: X->X,R;
q1->q2: b->b,R;
q1->q2: c->c,R;
q1->q3: a->X,L;
q1->qa: \_->\_,L;
q2->q2: b->b,R;
q2->q2: c->c,R;
q2->q2: X->X,R;
q2->q3: a->X,L;
q2->qr: \_->\_,L;
q3->q3: b->b,L;
q3->q3: c->c,L;
q3->q3: X->X,L;
q3->q4: $->$,R;
q4->q4: a->a,R;
q4->q4: c->c,R;
q4->q4: X->X,R;
q4->q5: b->X,L;
q4->qr: \_->\_,L;
q5->q5: a->a,L;
q5->q5: c->c,L;
q5->q5: X->X,L;
q5->q6: $->$,R;
q6->q6: a->a,R;
q6->q6: b->b,R;
q6->q6: X->X,R;
q6->q7: c->X,L;
q6->qr: \_->\_,L;
q7->q7: a->a,L;
q7->q7: b->b,L;
q7->q7: X->X,L;
q7->q1: $->$,R;
done.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

More Books

Students also viewed these Databases questions

Question

Conduct an effective performance feedback session. page 360

Answered: 1 week ago