This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Note on Minimal Congruences on Transition Graphs
January 1972 (vol. 21 no. 1)
pp. 96-97
B. Reusch, Gesellschaft f?r Mathematik und Dataverarbeitung MBH Bonn
A new proof is given for the following fact: All minimal congruences on a transition graph are of one of four types and can easily be obtained by inspecting the graph.
Index Terms:
Congruences, SP partitions, transition graphs.
Citation:
B. Reusch, "Note on Minimal Congruences on Transition Graphs," IEEE Transactions on Computers, vol. 21, no. 1, pp. 96-97, Jan. 1972, doi:10.1109/T-C.1972.223437
Usage of this product signifies your acceptance of the Terms of Use.