Semigroups and automorphism groups of strongly connected automata

DOI10.1007/BF01761703MaRDI QIDQ4775797zbMATH OpenFDO

Authors Kenji Uemura

Publication date 1974

Published in Mathematical Systems Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General theory for finite permutation groups (20B05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites work

• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 3223737 (Why is no real title available?)
• scientific article; zbMATH DE number 3310090 (Why is no real title available?)
• scientific article; zbMATH DE number 3061621 (Why is no real title available?)
• Groups of Automorphisms and Sets of Equivalence Classes of Input for Automata
• Isomorphism Groups of Automata
• On the Automorphism Group of an Automaton
• On the Structures of an Automaton and Its Input Semigroup
• On the group of automorphisms of strongly connected automata
• Structure and Transition-Preserving Functions of Finite Automata
• The Structure of an Automaton and Its Operation-Preserving Transformation Group

Cited in

(1)

• Induced permutation automata and coverings of strongly connected automata

This page was built for publication: Semigroups and automorphism groups of strongly connected automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4775797)