Abstract
Let U be a strictly increasing sequence of integers, and let L(U) be the set of greedy U-representations of all the nonnegative integers. The successor function maps the greedy U-representation of N onto the greedy U-representation of N+1. We show that the successor function associated to U is computable by a finite 2-tape automaton if and only if the set L(U) is recognizable by a finite automaton.
Preview
Unable to display preview. Download preview PDF.
References
V. Bruyère and G. Hansel, Recognizable sets of numbers in nonstandard bases. Proc. Latin 95, Lecture Notes in Computer Science 911 (1995), 167–179.
V. Bruyère and G. Hansel, Bertrand Numeration Systems and Recognizability. Preprint.
Ch. Choffrut, Une caractérisation des fonctions séquentielles et des fonctions sousséquentielles en tant que relations rationnelles. T.C.S. 5 (1977), 325–337.
S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, 1974.
A.S. Fraenkel, Systems of numeration. Amer. Math. Monthly 92(2) (1985), 105–114.
Ch. Frougny, Representation of numbers and finite automata. Math. Systems Theory 25 (1992), 37–60.
Ch. Frougny and B. Solomyak, On Representation of Integers in Linear Numeration Systems. LITP Report 94–54 (1994). To appear.
J.P. Gazeau, Quasicrystals and their Symmetries, in Symmetries and structural properties of condensed matter, Zajaczkowo 1994, Ed. T. Lulek, World Scientific. To appear.
P. Grabner, P. Liardet and R. Tichy, Odometers and systems of numeration. Acta Arithmetica LXXX. 2 (1995), 103–123.
M. Hollander, Greedy Numeration Systems and Recognizability. Preprint.
J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
J. Sakarovitch, Deux remarques sur un théorème d'Eilenberg. R.A.I.R.O. Inforhmatique Théorique 17 (1) (1983), 23–48.
J. Shallit, Numeration Systems, Linear Recurrences, and Regular Sets. Proc. I.C.A.L.P. 92, Wien, Lecture Notes in Computer Science 623 (1992), 89–100.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frougny, C. (1996). On the successor function in non-classical numeration systems. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_44
Download citation
DOI: https://doi.org/10.1007/3-540-60922-9_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60922-3
Online ISBN: 978-3-540-49723-3
eBook Packages: Springer Book Archive