Strongly automatic semigroups
Semi-groupes fortement automatiques
Anglais
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