A representation of strongly connected automata and its applications

DOI10.1016/0022-0000(78)90035-1MaRDI QIDQ1251071zbMATH OpenOpenAlexFDO

Authors Masami Ito

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

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Cites work

• A structure theory of automata characterized by groups
• 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 group of automorphisms of strongly connected automata
• Structure and Transition-Preserving Functions of Finite Automata
• The Automorphism Group of the Direct Product of Strongly Related Automata
• The Structure of an Automaton and Its Operation-Preserving Transformation Group

Cited in

(7)

• On a group-matrix type automaton with output
• Automorphism groups and factor automata of strongly connected automata
• The complexity of computing the automorphism group of automata and related problems
• Monoid-matrix type automata
• Representations of commutative asynchronous automata
• Some classes of automata as partially ordered sets
• On structure and representations of cyclic automata

This page was built for publication: A representation of strongly connected automata and its applications

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