On structure and representations of cyclic automata

DOI10.1016/j.tcs.2015.10.018zbMath1339.68174OpenAlexW2194250480MaRDI QIDQ897902

Jing Tian, Xianzhong Zhao, Yong Shao

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.018

zbMATH Keywords

endomorphism monoidssemiautomataClifford monoidsfinite unary algebras

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Unary algebras (08A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monoid-matrix type automata
• Representations of commutative asynchronous automata
• A representation of strongly connected automata and its applications
• Some results on the relation between automata and their automorphism groups
• Operation-preserving functions and autonomous factors of finite automata
• 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 endomorphisms of finite automata
• On the group of automorphisms of strongly connected automata
• Isomorphism Groups of Automata