pith. sign in

arxiv: 0808.2256 · v1 · submitted 2008-08-16 · 🧮 math.GR

Cayley automaton semigroups

classification 🧮 math.GR
keywords semigroupautomatoncayleyzerocharacterizefinitefreegroup
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.