The Community for Technology Leaders
Green Image
Issue No. 01 - January (1972 vol. 21)
ISSN: 0018-9340
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.
Congruences, SP partitions, transition graphs.
B. Reusch, "Note on Minimal Congruences on Transition Graphs", IEEE Transactions on Computers, vol. 21, no. , pp. 96-97, January 1972, doi:10.1109/T-C.1972.223437
96 ms
(Ver 3.3 (11022016))