An extension of the Cobham-Semënov theorem

Journal of Symbolic Logic

Volumn 65, Issue 1, 2000, Pages 201-211

  Bès, Alexis ^a,b  

^a LLAIC 1 and Team of Math Logic   (France)

^b INSTITUT DE MATHÉMATIQUES DE JUSSIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039015677     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586532     Document Type: Article

References (19)

1. A. BÈS, Undecidable extensions of Büchi arithmetic and Cobham-Semënov theorem, this JOURNAL, vol. 62 (1997), no. 4, pp. 1280-1296.
2. V. BRUYÈRE, Entiers et automates finis, U.E. Mons, mémoire de licence, 1984-85.
3. V. BRUYÈRE and G. HANSEL, Bertrand numeration systems and recognizability, Theoretical Computer Science, vol. 181 (1997), pp. 17-43.
4. V. BRUYÈRE, G. HANSEL, C. MICHAUX, and R. VILLEMAIRE, Logic and p-recognizable sets of integers, Bulletin of Belgian Mathematical Society, vol. 1 (1994), pp. 191-238.
5. J.R. BÜCHI, Weak second-order arithmetic and finite automata, Zeitschrift für Mathematische Logic und Grundlagen der Mathematik, vol. 6 (1960), pp. 66-92.
6. A. COBHAM, On the base-dependance of sets of numbers recognizable by finite automata, Mathematical Systems Theory, vol. 3 (1969), pp. 186-192.
7. F. DURAND, A generalization of Cobham's theorem, Theory of Computing Systems, vol. 31 (1998), pp. 169-185.
8. S. FABRE, Une généralisation du théorème de Cobham, Acta Arithmetica, vol. 67 (1994), pp. 197-208.
9. I. FAGNOT, Cobham's theorem and automaticity in non-standard bases, preprint, Paris 7 University, 1998.
10. A.S. FRAENKEL, Systems of numeration, American Mathematical Monthly, vol. 92 (1985), pp. 105-114.
11. d actions. Proceedings of the Warwick symposium, Warwick, UK, 1993-94 (Mark Pollicott et al., editors), London Mathematical Society Lecture Note Series, vol. 228, New York: Cambridge University Press, 1996, pp. 345-368.
12. G. HANSEL, A propos d'un théorème de Cobham, Actes de la Fête des Mots, Greco de Programmation, CNRS, Rouen, France (D. Perrin, editor), 1992.
13. _, Systèmes de numération indépendants et syndéticité, Theoretical Computer Science, vol. 204, No. 1-2 (1998), pp. 119-130.
14. C. MICHAUX and R. VILLEMAIRE, Cobham's theorem seen through Büchi theorem, Proceedings of Icalp'93, Springer Lecture Notes in Computer Science, vol. 700, 1993, pp. 325-334.
15. _, Open questions around Büchi and Presburger arithmetics, Logic: From foundations to applications, Proceedings of the European Logic Colloquium '93, Oxford University Press, 1996, pp. 353-383.
16. _, Presburger arithmetic and recognizability of sets of natural numbers by automata: new proofs of Cobham's and Semenov's theorems, Annals of Pure and Applied Logic, vol. 77 (1996), pp. 251-277.
17. A. MUCHNIK, Definable criterion for definability in Presburger Arithmetic and its application, (in Russian), preprint, Institute of new technologies, 1991.
18. F. POINT and V. BRUYÈRE, On the Cobham-Semenov theorem, Theory of Computing Systems, vol. 30 (1997), pp. 197-220.
19. A.L. SEMENOV, The Presburger nature of predicates that are regular in two number systems, Siberian Mathematical Journal, vol. 18 (1977), pp. 289-299.