dfa v1.0 starting
reading input finished.
start state a
states:a bg c f 

final states:c 

trace states:a bg c f 


Sorted transition table:
a	0	bg	
a	1	f	
bg	0	bg	
bg	1	c	
c	0	a	
c	1	c	
f	0	c	
f	1	bg	

tape = 01
step 1  a  0 at pos 1
tape=01
      ^
transition to state=bg
step 2  bg  1 at pos 2
tape=01
       ^
transition to state=c
step 3  c  #] at pos 3
tape=01
        ^
tape accepted after 3 steps, at c

tape = 10
step 1  a  1 at pos 1
tape=10
      ^
transition to state=f
step 2  f  0 at pos 2
tape=10
       ^
transition to state=c
step 3  c  #] at pos 3
tape=10
        ^
tape accepted after 3 steps, at c

tape = 00
step 1  a  0 at pos 1
tape=00
      ^
transition to state=bg
step 2  bg  0 at pos 2
tape=00
       ^
transition to state=bg
step 3  bg  #] at pos 3
tape=00
        ^
tape rejected after 3 steps, at bg

tape = 11
step 1  a  1 at pos 1
tape=11
      ^
transition to state=f
step 2  f  1 at pos 2
tape=11
       ^
transition to state=bg
step 3  bg  #] at pos 3
tape=11
        ^
tape rejected after 3 steps, at bg
 No more input tapes. Stopping.