Numeration systems on a regular language
Pierre B. A. Lecomte, Michel Rigo
Abstract
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of numeration, we show that ultimately periodic sets are recognizable. We also study the translation and the multiplication by constants as well as the order dependence of the recognizability.
Create a lesson
Related papers
Circular Economy Synergies and Trade-offs in Data Centres
Vlad C. Coroamă, Oana Dumbravă
Collaborative System Failure Prognostics via Federated Longitudinal-Survival Modeling
Fan Yang, Madelyn Weller, Dimuthu Fernando et al.
Interactive Extraction of High-Frequency Aesthetically-Coherent Colormaps
Santiago V. Lombeyda, Mathieu Desbrun
Digital Twin Modeling of a Highly Automated Agricultural Tractor
Clay Hallman, Lukas Pindl, Timo Oksanen
Risk-based Design for Sustainability in Cloud Systems: Insights from an Experts' Survey
Maria Voreakou, Cleopatra Bardaki, George Kousiouris et al.
Model Collapse: On Recursion, Noise, and Uncharted Machine Visions
Violaine Boutet de Monvel