Abstract

Let U be a strictly increasing sequence of integers. By a greedy algorithm, every nonnegative integer has a greedy U-representation. The successor function maps the greedy U-representation of N onto the greedy U-representation of N+1. We characterize the sequences U such that the successor function associated to U is a left, resp. a right sequential function. We also show that the odometer associated to U is continuous if and only if the successor function is right sequential.

Citations

3377	Introduction to Automata Theory, Languages, and Computation - Hopcroft, Motwani, et al. - 2003
159	Signed-digit number representations for fast parallel arithmetic - Avizienis - 1961
158	Representations for real numbers and their ergodic properties - Rényi - 1957
151	On the β-expansions of real numbers - Parry - 1960
102	Transductions and Context-Free Languages, Teubner - Berstel - 1979
46	Systems of numeration - Fraenkel - 1985
29	Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationnelles - Choffrut - 1977
27	Numeration systems, linear recurrences, and regular sets - Shallit - 1994
24	Comment écrire les nombres entiers dans une base qui n’est pas entière - Bertrand-Mathis - 1989
23	On the representation of integers in linear numeration systems, in Ergodic theory of Zd actions - Frougny - 1996
10	Synchronisation déterministe des automates à délai borné, Theoret - Frougny - 1998
8	On-line arithmetic: An overview. Real time - Ercegovac - 1984
2	Odometers and systems of numeration. Acta Arithmetica LXXX.2 - Grabner, Liardet, et al. - 1995
2	Description des monoides de type fini - Sakarovitch - 1981
1	On the successor function in non-classical numeration systems - Frougny - 1996
1	Greedy Numeration Systems and Recognizability - Hollander - 1995
1	Deux remarques sur un th'eor`eme d'Eilenberg - Sakarovitch - 1983