# Accepts binary strings of form 0^n1^n for n>=0.

Q={start,accept,findone,found,end}
I=start
F=accept
G={0,1,A,B,b}
S={0,1}
D={(start,b,accept,b,R), (start,0,findone,A,R), (start,B,end,B,R),
   (findone,0,findone,0,R), (findone,1,found,B,L),(findone,B,findone,B,R),
   (found,B,found,B,L), (found,0,found,0,L), (found,A,start,A,R),
   (end,B,end,B,R), (end,b,accept,b,R)}