Semi-groupes fortement automatiques
classification
🧮 math.CO
keywords
notionauto-automaticautomaticityautomatiquesbeta-adicscriteriondeveloppements
read the original 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.
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.