Logic and {$p$}-recognizable sets of integers
Véronique Bruyàre, G. Hansel, Christian Michaux, Roger Villemaire · Bulletin of the Belgian Mathematical Society - Simon Stevin · 1994
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.