Semi-groupes fortement automatiques
Combinatorics
2015-03-19 v1
Abstract
In this paper, we introduce the notion of strongly automatic semigroup, which implies the usual notion of auto- maticity. We focus on semigroups of \beta-adics developpements, for which we obtain a criterion of strong automaticity.
Cite
@article{arxiv.1112.1266,
title = {Semi-groupes fortement automatiques},
author = {Paul Mercat},
journal= {arXiv preprint arXiv:1112.1266},
year = {2015}
}
Comments
45 pages, 46 figures