This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
null Chao-Chin Yang, Department of Information Sciences, University of Alabama in Birmingham
For the given directed graphs, a method based on Moore sequential machines (MSM) for solving the graph isomorphism problem was recently proposed. However, that method provides only a necessary (but not a sufficient) condition. This correspondence corrects this error by developing a necessary and sufficient condition. It will be shown that this type of problem can be also solved by using deterministic state machines (DSM). But there are tradeoffs to be considered in using either DSM's or MSM's. In addition, the effectiveness of the method based on MSM's depends very much on the output definition.
Index Terms:
nondeterministic state machine, Automatum, deterministic state machine, directed graph, isomorphism, Moore sequential machine
Citation:
null Chao-Chin Yang, C.P. May, "A Correction and Some Comments Concerning Graph Isomorphism by Finite Automata," IEEE Transactions on Computers, vol. 27, no. 1, pp. 95-96, Jan. 1978, doi:10.1109/TC.1978.1674961
Usage of this product signifies your acceptance of the Terms of Use.