Odometers on Regular Languages - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Theory of Computing Systems Year : 2007

Odometers on Regular Languages


Odometers or "adding machines" are usually introduced in the context of positional numeration systems built on a strictly increasing sequenceof integers. We generalize this notion to systems defined on an arbitrary infinite regular language. In this latter situation, if (A,<) is a totally ordered alphabet, then enumerating the words of a regular language L over A with respect to the induced genealogical ordering gives a one-to-one correspondence between N and L. In this general setting, the odometer is not defined on a set of sequences of digits but on a set of pairs of sequences where the first (resp. the second) component of the pair is an infinite word over A (resp. an infinite sequence of states of the minimal automaton of L). We study some properties of the odometer like continuity, injectivity, surjectivity, minimality,. . .We then study some particular cases: we show the equivalence of this new function with the classical odometer built upon a sequence of integers whenever the set of greedy representations of all the integers is a regular language; we also consider substitution numeration systems as well as the connection with BETA-numerations.
Fichier principal
Vignette du fichier
D220.pdf (385.27 Ko) Télécharger le fichier

Dates and versions

lirmm-00130835 , version 1 (27-02-2007)



Valerie Berthe, Michel Rigo. Odometers on Regular Languages. Theory of Computing Systems, 2007, 40, pp.001-031. ⟨10.1007/s00224-005-1215-5⟩. ⟨lirmm-00130835⟩
64 View
175 Download



Gmail Facebook X LinkedIn More