Bertrand numeration systems and recognizability

Theoretical Computer Science

Volumn 181, Issue 1, 1997, Pages 17-43

  Bruyère, Véronique ^a   Hansel, Georges ^b  

^a UNIVERSITY OF MONS   (Belgium)

^b UNIVERSITÉ DE ROUEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; POLYNOMIALS; THEOREM PROVING;

BERTRAND NUMERATION SYSTEMS; PISOT NUMBER;

SET THEORY;

EID: 0031193143     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00260-5     Document Type: Article

References (26)

1. J.-P. Allouche, q-regular sequences and other generalizations of g-automatic sequences, Proc. Latin '92, Lecture Notes in Computer Science, Vol. 583 (1992) 15-23.
2. J.-P. Allouche, E. Cateland, W.J. Gilbert, H.-O. Peitgen, J.O. Shallit and G. Skordev, Automatic maps in exotic numeration systems, Math. Systems Theory (1996) to appear.
3. M.P. Béal, Codage symbolique, Masson (1993).
4. A. Bertrand-Mathis, Comment écrire les nombres entiers dans une base qui n'est pas entière, Acta Math. Acad. Sci. Hungary 54 (1989) 237-241.
5. n≥0, langages codés et θ-shift, Bull Soc. Math. France 114 (1986) 271-323.
6. A. Bès, An extension of the Cobham-Semenov theorem, preprint (1996).
7. V. Bruyère and G. Hansel, Recognizable sets of numbers in nonstandard bases, Lecture Notes in Computer Science, Vol. 911 (1995) 167-179.
8. V. Bruyère, G. Hansel, C. Michaux and R. Villemaire, Logic and p-recognizable sets of integers, Bull. Belg. Math. Soc. 1 (1994) 191-238.
9. J.R. Büchi, Weak second-order arithmetic and finite automata, Z. Math. Logik Grundlag. Math. 6 (1960) 66-92.
10. G. Christol, T. Kamae, M. Mendès France and G. Rauzy, Suites algébriques, automates et substitutions, Bull. Soc. Math. France 108 (1980) 401-419.
11. A. Cobham, On the base-dependence of sets of numbers recognizable by finite automata, Math. Systems Theory 3 (1969) 186-192.
12. A. Cobham, Uniform tag systems, Math. Systems Theory 6 (1972) 164-192.
13. S. Eilenberg, Automata, Languages and Machines, Vol. A (Academic Press, New York, 1974).
14. S. Fabre, Substitutions et independence des systèmes de numération, Thèse, Université Aix-Marseille II (1992).
15. A.S. Fraenkel, Systems of numeration, Amer. Math. Monthly 92 (1985) 105-114.
16. C. Frougny, Representations of numbers and finite automata, Math. Systems Theory 25 (1992) 37-60.
17. d-Actions, London Math. Soc. Lecture Note, Vol. 228 (1996) 345-368.
18. G. Hansel, Sur la syndéticité d'une partie (θ, θ′)-reconnaissable de ℕ, manuscript (1995).
19. B.R. Hodgson, Décidabilité par automate fini, Ann. Sci. Math. Québec 7 (1983) 39-57.
20. M. Hollander, Greedy numeration systems and regularity, preprint (1995)
21. N. Loraud, β-shift, systèmes de numération et automates, preprint (1995).
22. W. Parry, On the β-expansions of real numbers, Acta Math. Acad. Sci. Hungar. 11 (1960) 401-416.
23. D. Perrin, Finite automata, in: J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990) 2-57.
24. F. Point and V. Bruyère, On the Cobham-Semenov theorem, Theory Comput. Systems 30 (1997) 197-220.
25. J. Shallit, Numeration systems, linear recurrences and regular sets, Lecture Notes in Computer Science, Vol. 623 (1992) 89-100.
26. l] is undecidable, Theoret. Comput. Sci. 106 (1992) 337-349.