Induced permutation automata and coverings of strongly connected automata

DOI10.1016/S0166-218X(98)00150-4zbMath0923.20049MaRDI QIDQ1283800

Kimio Sugita, Takeo Yaku, Kenji Uemura

Publication date: 9 September 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

idempotentsadmissible systemsstrongly connected automatadecompositions of automatacascade products

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic principles for the analysis of the biochemical system
• Congruences et automorphismes des automates finis
• Semigroups and automorphism groups of strongly connected automata
• The Structure of an Automaton and Its Operation-Preserving Transformation Group
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Structure and Transition-Preserving Functions of Finite Automata
• Endliche Gruppen I
• Isomorphism Groups of Automata