Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism

Authors:
Chao-Chih Yang
Affiliations:
Department of Information Sciences, University of Alabama
Venue:
IEEE Transactions on Computers
Year:
1975

Citing 8
Cited 2

Lattice Properties of Sequential Machines

Journal of the ACM (JACM)
Structure and Transition-Preserving Functions of Finite Automata

Journal of the ACM (JACM)
An Efficient Algorithm for Graph Isomorphism

Journal of the ACM (JACM)
A Backtrack Procedure for Isomorphism of Directed Graphs

Journal of the ACM (JACM)
GIT—a heuristic program for testing pairs of directed line graphs for isomorphism

Communications of the ACM
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Generation of All Closed Partitions on the State Set of a Sequential Machine

IEEE Transactions on Computers
Finite automata and their decision problems

IBM Journal of Research and Development

A Correction and Some Comments Concerning Graph Isomorphism by Finite Automata

IEEE Transactions on Computers
An Algorithm for Deriving All Pairs of Compatible States by Closure Classes

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

Abstract

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.