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.
Keywords :
Index Terms-Automorphism, closed partition, directed graph, endomorphism, finite automaton, homomorphism, isomorphism, sequential machine, state machine, undirected graph.; Application software; Automata; Computer applications; Computer errors; Data preprocessing; Digital arithmetic; Error correction; Hardware; Logic; Partitioning algorithms; Index Terms-Automorphism, closed partition, directed graph, endomorphism, finite automaton, homomorphism, isomorphism, sequential machine, state machine, undirected graph.;
