Results 1 
3 of
3
Logic and precognizable sets of integers
 Bull. Belg. Math. Soc
, 1994
"... We survey the properties of sets of integers recognizable by automata when they are written in pary 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 ..."
Abstract

Cited by 68 (4 self)
 Add to MetaCart
We survey the properties of sets of integers recognizable by automata when they are written in pary 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 CobhamSemenov, the original proof being published in Russian. 1
ON THE EXPANSION (N, +, 2 x) OF PRESBURGER ARITHMETIC FRANÇOISE POINT 1
"... This is based on a preprint ([9]) which appeared in the Proceedings of the fourth ..."
Abstract
 Add to MetaCart
This is based on a preprint ([9]) which appeared in the Proceedings of the fourth