Implementing Computations in Automaton (Semi)groups
classification
💻 cs.FL
math.GR
keywords
automatongroupssemiorderproposecomparecomputationsconjectures
read the original abstract
We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order of finite automaton (semi)groups.
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.