; we show that the two automatas are equal, 
; i.e. there is no situation where one accepts and the other not
; example from hopcroft p168, 2nd german edition
1 var 1 state1
2 var 1 input
3 next 1 1 2

4 var 2 state2
5 const 2 00
6 const 2 01
7 const 2 10
8 eq 1 4 7
9 cond 2 8 5 6
10 cond 2 2 7 9 
11 next 2 4 10

12 zero 1
13 ult 1 4 7
14 ne 1 1 12
15 and 1 13 14

16 eq 1 1 12
17 eq 1 4 7
18 and 1 16 17

19 or 1 15 18
20 root 1 19