Question

Technical Review -Turing Machines 1. Machine #1 is very simple. State Read Symbols Write Symbol RAL Read 0 New State q Halt (L Read 1 L Read 1 0 L Run this machine on the following tapes and produce the result. Determine what this machine does The starting head position is marked by the arrow. 0011 100162 a) 1 † 1 10100 101112 0 0 b) 101 + 11000L 11000 safler halt, all reading Symbol remain some and stoping Adding I

Answer 1

Machine Halt Next state= Read ²0 next state= Halt Turing 1,014 Read Colib) Tape ololi 1107 Current state = Read Tape alphabet = 1 110101 current state = Read Tape alphabet =) corrent state - Read Read Tape alphabet = 0 o t Next state = Read 1 O 0 1 Antolilole 11100 6 ) 1 100 state - Read alphabet = 1 Next state - Read E Next state = Read state = Read alphabet =1 11000 state= Read alphabet = next state = [10101010107 Read state = Read alphabet=0 Next State = Halt Lilololo