Semigroups and automorphism groups of strongly connected automata
From MaRDI portal
Publication:4775797
DOI10.1007/BF01761703zbMath0287.94039MaRDI QIDQ4775797
Publication date: 1974
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) General theory for finite permutation groups (20B05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Structure of an Automaton and Its Operation-Preserving Transformation Group
- On the Automorphism Group of an Automaton
- On the Structures of an Automaton and Its Input Semigroup
- Structure and Transition-Preserving Functions of Finite Automata
- Groups of Automorphisms and Sets of Equivalence Classes of Input for Automata
- On the group of automorphisms of strongly connected automata
- Isomorphism Groups of Automata
This page was built for publication: Semigroups and automorphism groups of strongly connected automata