On the structure of abelian automata

Authors:
Yukio Shibata
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1976

Citing 3
Cited 0

Isomorphism Groups of Automata

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

Journal of the ACM (JACM)
Finite automata and their decision problems

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

The structure of an abelian automaton is studied in connection with the notion of the stage and the transition structure of an automaton introduced in [6]. The transition structure of an abelian automaton and the commutativity of its automorphism group are investigated. Each stage of an abelian automaton is a perfect automaton with a subset of input symbols related to the stage, and if stages S and S' are in the relation SS', then the stage S', is decomposed into a disjoint union of perfect automata that are homomorphic images of the perfect automaton defined by the stage S and isomorphic to each other.