Question

Discrete Mathematical Structures

Draw a Turing machine that takes a string representing two unary numbers, x and y, separated by a 0, and determines whether x greaterthanorequalto y. For example, the input for x = 3, y = 4 would be 11101111. Use two halt states: one for yes and one for no. Give the trace of your machine in the previous problem processing the strings 11101111 and 11110111. Draw a TM that computes f(w) = w^R where w elementof (a + b)*.

Answer 1

CI,o,t) 8) Give the tue Your Machine ''n the n« evious problin) it (ur symbals is nove lett and nove righ and oneto o Move γ1ght I+ Curncar Symbdl s\ move lett and Convevt 0 to l II IA Convert- O to I and move ijhr noved Iight

move righr -convert Itoo til 111.0 소 left tonve亻ト自ヤ and HAUT *IU OI1 ~ 0 A move v OIA move i3hr [11101111ㅿ 1111 l'I | Δ 1 o A move ight it current symbols is1 move ler Ond conrat o toj and move ygh moved γ¡gnr f111101 J 0

sking is aba K,a,t) b, l