Cayley automaton semigroups
Victor Maltcev
TL;DR
This paper characterizes various algebraic properties of Cayley automaton semigroups, such as when they form groups, are trivial, finite, free, or zero semigroups, providing a comprehensive classification.
Contribution
It provides a complete characterization of Cayley automaton semigroups regarding their algebraic structure and special cases.
Findings
Identifies conditions for Cayley automaton semigroups to be groups or trivial
Determines when these semigroups are finite or free
Classifies when they are left or right zero semigroups
Abstract
In this paper we characterize when a Cayley automaton semigroup is a group, is trivial, is finite, is free, is a left zero semigroup, or is a right zero semigroup.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic · Mathematical Dynamics and Fractals