myhill v1.0 starting
reading input finished.
start state a
states:a b c d e f g h 

final states:c 

Sorted original transition table:
a	0	b	
a	1	f	
b	0	g	
b	1	c	
c	0	a	
c	1	c	
d	0	c	
d	1	e	
e	0	b	
e	1	f	
f	0	c	
f	1	g	
g	0	g	
g	1	c	
h	0	g	
h	1	c	

reachable states: a b c f g 
remaining transitions:
a	0	b	
a	1	f	
b	0	g	
b	1	c	
c	0	a	
c	1	c	
f	0	c	
f	1	g	
g	0	g	
g	1	c	
remaining final states: c 
Q - F : a  b  f  g  
matrix M after step 1)
	a	b	c	f	g	
a	-	 	x	 	 	
b	-	-	x	 	 	
c	-	-	-	x	x	
f	-	-	-	-	 	
g	-	-	-	-	-	

matrix M after F X F)
	a	b	c	f	g	
a	-	 	x	 	 	
b	-	-	x	 	 	
c	-	-	-	x	x	
f	-	-	-	-	 	
g	-	-	-	-	-	

matrix M after Q-F x Q-F)
	a	b	c	f	g	
a	-	x	x	x	x	
b	-	-	x	x	 	
c	-	-	-	x	x	
f	-	-	-	-	x	
g	-	-	-	-	-	


state minimization mapping:
a  a
b  bg
c  c
f  f
g  bg

Myhill-Nerode minimization finished