Question

1) Write a transition diagram for a Turing Machine that satisfies the following specifications. Do not make it skeletal -- show all possible transitions. (That means 3 transitions from each state (except the halt state) since Γ = {x, y, Δ} for this problem.)

Pre: |Δ alpha Δ ....     where alpha is a string of letters from {x,y} and ... are all Δ

Post: if alpha is in the language described by regular expression (xy)* halt in the leftmost cell with the tape unchanged. Otherwise, make an abnormal termination occur.

Answer 1

Answer Given that Then a trantation daigsram fos' a Twing machine that Satisfies. * 3 Transębione from Each state Expect the hall stale L r = {x,g, 4] where alpha is a strong string of letters from {xey's @ @KÂIR "FIL X I My s

→ 0- 0 for Cayo = € - Nell string → @@ for marking Each (xy) as Cab) ☺ ☺ D for severting cabo back - to oxy) > (F) is a final state » (D) is a Dead State => 0 is the state on the initial state. - * - Scanned with CamScanner