Strongly automatic semigroups
Semi-groupes fortement automatiques
- Consulter un extrait
- Année : 2013
- Fascicule : 3
- Tome : 141
- Format : Électronique
- Langue de l'ouvrage :
Anglais - Class. Math. : 20M17, 20M05, 20M35, 11A63, 68R15
- Pages : 423-479
- DOI : 10.24033/bsmf.2653
In this paper, we introduce the notion of strongly automatic semigroup, which implies the usual notion of automaticity. We focus on semigroups of $\beta $-adics developpements, for which we obtain a criterion of strong automaticity.
Semigroups, monoids, finite presentation, automaticity, finite-state automatons, regular languages, algebraic numbers, Salem numbers, radix expansions, growth