Systèmes de numération indépendants et syndéticité

Theoretical Computer Science

Volumn 204, Issue 1-2, 1998, Pages 119-130

  Hansel, Georges ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

Automates; Syst mes de num ration; Th or me de Cobham

Indexed keywords

EID: 0012901468     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00035-8     Document Type: Article

References (9)

1. A. Bertrand-Mathis, Comment écrire les nombres entiers dans une base qui n'est pas entière, Acta Math. Sci. Hungar. 54 (1989) 237-241.
2. A. Bes, An extension of the Cobham-Semenov theorem, preprint, 1996, 10 pp.
3. V. Bruyère, Automata and numeration systems, http://cartan.u-strasbg.ft:80/~slc, 1996.
4. V. Bruyère, G. Hansel, Bertrand numeration systems and recognizability, preprint, 1995, 22 pp.
5. V. Bruyère, G. Hansel, C. Michaux, R. Villemaire, Logic and p-recognizable sets of integers, Bull. Belg. Math. Soc. 1 (1994) 191-238.
6. A. Cobham, On the base-dependence of sels of numbers recognizable by finite automata, Math. Systems Theory 6 (1972) 164-192.
7. S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, 1974.
8. d-Actions, London Mathematical Society Lecture Note Series, vol. 228, Cambridge University Press, Cambridge, 1996, 345-368
9. C. Michaux, R. Villemaire, Presburger arithmetic and recognizability of natural numbers by automata: new proofs of Cobham's and Semenov's theorems, Ann. Pure Appl. Logic 77 (1996) 251-277.