Logic and p-recognizable sets of integers (1994)
by
Véronique Bruyère
,
Georges Hansel
,
Christian Michaux
,
Roger Villemaire
| Venue: | Bull. Belg. Math. Soc |
| Citations: | 52 - 4 self |
BibTeX
@ARTICLE{Bruyère94logicand,
author = {Véronique Bruyère and Georges Hansel and Christian Michaux and Roger Villemaire},
title = {Logic and p-recognizable sets of integers},
journal = {Bull. Belg. Math. Soc},
year = {1994},
volume = {1},
pages = {191--238}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We survey the properties of sets of integers recognizable by automata when they are written in p-ary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to N m due to Semenov. We detail the remarkable proof recently given by Muchnik for the theorem of Cobham-Semenov, the original proof being published in Russian. 1
