Question

rarisition written in the format of the Turing Machine simulator is a special state H which means halt. For the given Below is a Turing machine program where each line is a transition writen current state, read symbol, new state, write symbol, drection e-d. wmeans to state 4, write a 1 and move the tape head left. Notc there is a special state a os on the leftmost n nanks , write the resulting bitstring when the TM reaches the halt state, assuming the tape ,1,< means when in state 3 with read symbol is 0, go e that the underscore character means a blank. The input string is assumed to be 1,0,2,0,> 2,0,2,0,> head starts on the leftmost bit of the input string. is assumed to be preceded and followed by all blanks Resulting bitstring when TM halts Input string b) 0 c) 10 d) 001 d) 101 e) 000001 f) 101111 4,0,4,0,<

Answer 1

O,0.L 0,1, L o.。 ウ 1@o Đ loO-Đ l@o うO-', Ż , i oooo oi@-> ooo@이。Ð ooooo② 1 ooooo C 1 oo@oo'o ק oooo③ oo Ż OJO クC 10 1011,1 リ10111, 少 ion,⑨う 丨。③ 100 ,o'l@,o Điol@100 ⓥ-110000 10, i,'。一之 lon»③! 1@ooooo → @) i 10000 う