A representation of strongly connected automata and its applications
From MaRDI portal
Publication:1251071
DOI10.1016/0022-0000(78)90035-1zbMath0389.68032OpenAlexW2040130113MaRDI QIDQ1251071
Publication date: 1978
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(78)90035-1
Related Items (7)
On a group-matrix type automaton with output ⋮ Automorphism groups and factor automata of strongly connected automata ⋮ Monoid-matrix type automata ⋮ On structure and representations of cyclic automata ⋮ Representations of commutative asynchronous automata ⋮ The complexity of computing the automorphism group of automata and related problems ⋮ Some classes of automata as partially ordered sets
Cites Work
- A structure theory of automata characterized by groups
- The Automorphism Group of the Direct Product of Strongly Related Automata
- The Structure of an Automaton and Its Operation-Preserving Transformation Group
- On the Automorphism Group of an Automaton
- 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: A representation of strongly connected automata and its applications
