Implementing Computations in Automaton (Semi)groups
Formal Languages and Automata Theory
2013-10-21 v1 Group Theory
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.
Cite
@article{arxiv.1310.4856,
title = {Implementing Computations in Automaton (Semi)groups},
author = {Ines Klimann and Jean Mairesse and Matthieu Picantin},
journal= {arXiv preprint arXiv:1310.4856},
year = {2013}
}
Comments
12 pages, 4 figures, 3 tables, CIAA 2012