International audienceCobham's theorem asserts that if a sequence is automatic with respect to two multiplicatively independent bases, then it is ultimately periodic. We prove a stronger density version of the result: if two sequences which are automatic with respect to two multiplicatively independent bases coincide on a set of density one, then they also coincide on a set of density one with a periodic sequence. We apply the result to a problem of Deshouillers and Ruzsa concerning the least nonzero digit of n! in base 12
International audienceThe aim of this short note is to generalise the result of Rampersad-Shallit sa...
International audienceWe study substitutive systems generated by nonprimitive substitutions and show...
A general density theory of the set of prime divisors of linear recurring sequences with constant co...
17 pagesWe introduce the notion of an asymptotically automatic sequence, which generalises the notio...
Abstract. A sequence is said to be k-automatic if the n th term of this sequence is generated by a f...
Cameron has introduced a natural one-to-one correspondence between infinite binary sequences and set...
International audienceIn this paper we develop a method to transfer density results for primitive au...
AbstractWe revisit a technique of S. Lehr on automata and use it to prove old and new results in a s...
Cameron has introduced a natural one-to-one correspondence between infinite binary se-quences and se...
AbstractIt is conjectured that an integer sequence containing no k consecutive terms of any arithmet...
peer reviewedWe make certain bounds in Krebs’ proof of Cobham’s theorem explicit and obtain correspo...
This article considers the relation between the spanning properties of lattice orbits of discrete se...
Given an integer base b>1, a set of integers is represented in base b by a language over {0,1,...,b-...
International audienceWe show that any automatic multiplicative sequence either coincides with a Dir...
28 pagesWe give new combinatorial proofs of known almost-periodicity results for sumsets of sets wit...
International audienceThe aim of this short note is to generalise the result of Rampersad-Shallit sa...
International audienceWe study substitutive systems generated by nonprimitive substitutions and show...
A general density theory of the set of prime divisors of linear recurring sequences with constant co...
17 pagesWe introduce the notion of an asymptotically automatic sequence, which generalises the notio...
Abstract. A sequence is said to be k-automatic if the n th term of this sequence is generated by a f...
Cameron has introduced a natural one-to-one correspondence between infinite binary sequences and set...
International audienceIn this paper we develop a method to transfer density results for primitive au...
AbstractWe revisit a technique of S. Lehr on automata and use it to prove old and new results in a s...
Cameron has introduced a natural one-to-one correspondence between infinite binary se-quences and se...
AbstractIt is conjectured that an integer sequence containing no k consecutive terms of any arithmet...
peer reviewedWe make certain bounds in Krebs’ proof of Cobham’s theorem explicit and obtain correspo...
This article considers the relation between the spanning properties of lattice orbits of discrete se...
Given an integer base b>1, a set of integers is represented in base b by a language over {0,1,...,b-...
International audienceWe show that any automatic multiplicative sequence either coincides with a Dir...
28 pagesWe give new combinatorial proofs of known almost-periodicity results for sumsets of sets wit...
International audienceThe aim of this short note is to generalise the result of Rampersad-Shallit sa...
International audienceWe study substitutive systems generated by nonprimitive substitutions and show...
A general density theory of the set of prime divisors of linear recurring sequences with constant co...