tm.cpp starting
// l0n1nr.tm
// accept the language L = { 0^n 1^n | n>0 } 
// book page 150  Fig. 7.2
reading input finished.
start state q0
states:q0 q1 q2 q3 q4 

final states:q4 

trace states:No states to trace
Sorted transition table:
q0	0	q1	X	R
q0	Y	q3	Y	R
q1	0	q1	0	R
q1	1	q2	Y	L
q1	Y	q1	Y	R
q2	0	q2	0	L
q2	X	q0	X	R
q2	Y	q2	Y	L
q3	#b	q4	#b	R
q3	Y	q3	Y	R
q4	#b	q4	#b	N

tape = 01 
tape accepted after 6 steps, at q4



tape = 10 
No next transition, quitting now
tape rejected after 1 steps, at q0



tape = 11 
No next transition, quitting now
tape rejected after 1 steps, at q0



tape = 00 
No next transition, quitting now
tape rejected after 3 steps, at q1



tape = 001 
No next transition, quitting now
tape rejected after 8 steps, at q1



tape = 011 
No next transition, quitting now
tape rejected after 5 steps, at q3



tape = 0011 
tape accepted after 14 steps, at q4



tape = 00001111 
tape accepted after 42 steps, at q4



 No more input tapes. Stopping.