This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism
November 1975 (vol. 24 no. 11)
pp. 1133-1139
null Chao-Chih Yang, Department of Information Sciences, University of Alabama
The transition preserving morphisms (endomorphism, homomorphism, isomorphism, and automorphism) of state machines are developed on the basis of nontrivial closed partitions over their state sets. Algorithms with illustrated examples are provided for determining these morphisms. By means of these morphisms, the structural preserving morphisms of finite automata can be readily solved by simply making a constraint on each partition being not only nontrivial and closed but also output-consistent.
Index Terms:
Index Terms-Automorphism, closed partition, directed graph, endomorphism, finite automaton, homomorphism, isomorphism, sequential machine, state machine, undirected graph.
Citation:
null Chao-Chih Yang, "Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism," IEEE Transactions on Computers, vol. 24, no. 11, pp. 1133-1139, Nov. 1975, doi:10.1109/T-C.1975.224148
Usage of this product signifies your acceptance of the Terms of Use.