Representations of commutative asynchronous automata

DOI10.1016/j.jcss.2011.06.002zbMath1237.68120MaRDI QIDQ414910

Xianzhong Zhao, Jing Tian

Publication date: 11 May 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.06.002

zbMATH Keywords

representation; endomorphism monoid; \(S\)-automata; Clifford monoid-matrix type automata; commutative asynchronous automata

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q70: Algebraic theory of languages and automata

Related Items

Monoid-matrix type automata, On structure and representations of cyclic automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A representation of strongly connected automata and its applications
• A structure theory of automata characterized by groups
• The cartesian composition of automata
• Algebraic Theory of Automata and Languages
• The Automorphism Group of the Direct Product of Strongly Related Automata
• The Structure of an Automaton and Its Operation-Preserving Transformation Group
• Group-Type Automata
• 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