AN ALGORITHM FOR FINDING HOMOMORPHISMS OF FINITE AUTOMATA
Guangyan Zhou · Chinese Journal of Computers · 1982
Let U= (S,Σ,δ) and B= (T, Σ, r) are n-state automata, we denote the set of ail homomorphisms of U into 93 by H(U→B), the set of all isomorphisms of U onto B by Is(U→B), the set of all endomorphisms of U by E(U), and the set of all automorphisms of U by G(U). In this paper, an equivalence relation π between elements of matrix and an algorithm for determining H(U→B) and Is(U→B) are presented via application of the matrix representation method to the mappings, and this algorithm can be used to determine endomorphism semigroup E(U) and automorphism group