Theory of Computation - Turing Machine Simulator

http://morphett.info/turing/turing.html#LoadMenu

Use the above website to create the simulated Turing Machine of the diagram below. Please include comments.

EXAMPLE 3.9 The following is a formal description of Mi- (Q,2.T, 6, 91, laccept, Qreject), the Turing machine that we informally described (page 167) for deciding the lan- guage B = {w#u1 w e(0,1}*). * We describe ? with a state diagram (see the following figure) .The start, accept, and reject states are qi, laccept, and qreject, respectivel,y 41 0,1 R 2 Is 94 75 laccept 6 0,1,x L 0,1 L EXAMPLE 3.9 The following is a formal description of Mi- (Q,2.T, 6, 91, laccept, Qreject), the Turing machine that we informally described (page 167) for deciding the lan- guage B = {w#u1 w e(0,1}*). * We describe ? with a state diagram (see the following figure) .The start, accept, and reject states are qi, laccept, and qreject, respectivel,y 41 0,1 R 2 Is 94 75 laccept 6 0,1,x L 0,1 L