Groups of Automorphisms and Sets of Equivalence Classes of Input for Automata

DOI10.1145/321296.321306zbMath0199.04004OpenAlexW1997965329MaRDI QIDQ5596814

Bruce H. Barnes

Publication date: 1965

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321296.321306

zbMATH Keywords

languages, automata, networks

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

On a group-matrix type automaton with output ⋮ On the group of automorphisms of strongly connected automata ⋮ Monoid-matrix type automata ⋮ On structure and representations of cyclic automata ⋮ Representations of commutative asynchronous automata ⋮ Unnamed Item ⋮ A characterization of automata and a direct product decomposition ⋮ A representation of strongly connected automata and its applications ⋮ Externally induced operations ⋮ Semigroups and automorphism groups of strongly connected automata

This page was built for publication: Groups of Automorphisms and Sets of Equivalence Classes of Input for Automata