By Topic

A Correction and Some Comments Concerning Graph Isomorphism by Finite Automata

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yang, Chao-Chih ; Department of Information Sciences, University of Alabama in Birmingham ; May, C.P.

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-27 ,  Issue: 1 )