Semigroups and automorphism groups of strongly connected automata

DOI10.1007/BF01761703zbMATH Open0287.94039MaRDI QIDQ4775797FDOQ4775797

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Structure of an Automaton and Its Operation-Preserving Transformation Group
• On the Automorphism Group of an Automaton
• 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
• Structure and Transition-Preserving Functions of Finite Automata
• On the Structures of an Automaton and Its Input Semigroup

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)