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
A generalization of Cobham’s theorem
 Theory Comput. Syst
, 1998
"... Abstract If a nonperiodic sequence X is the image by a morphism of a fixed point of both a primitive substitution σ and a primitive substitution τ, then the dominant eigenvalues of the matrices of σ and of τ are multiplicatively dependent. This is the way we propose to generalize Cobham’s Theorem. ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
Abstract If a nonperiodic sequence X is the image by a morphism of a fixed point of both a primitive substitution σ and a primitive substitution τ, then the dominant eigenvalues of the matrices of σ and of τ are multiplicatively dependent. This is the way we propose to generalize Cobham’s Theorem. 1
A Survey of Arithmetical Definability
, 2002
"... We survey definability and decidability issues related to firstorder fragments of arithmetic, with a special emphasis on Presburger and Skolem arithmetic and their (un)decidable extensions. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We survey definability and decidability issues related to firstorder fragments of arithmetic, with a special emphasis on Presburger and Skolem arithmetic and their (un)decidable extensions.