The Dynamical Mordell-Lang Conjecture is an analogue of the classical Mordell-Lang
conjecture in the context of arithmetic dynamics. It predicts the behavior of the orbit of a point …

We study the coefficients of algebraic functions∑ n≥ 0fnzn. First, we recall the too-little-
known fact that these coefficients fn always admit a closed form. Then we study their …

Formal Languages, Automaton and Numeration Systems presents readers with a review of
research related to formal language theory, combinatorics on words or numeration systems …

In this paper we use the framework of automatic sequences to study combinatorial
sequences modulo prime powers. Given a sequence whose generating function is the …

The interplay between words, computability, algebra and arithmetic has now proved its
relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite …

Analytic Combinatorics: A Multidimensional Approach is written in a reader-friendly fashion
to better facilitate the understanding of the subject. Naturally, it is a firm introduction to the …

R.–Nous démontrons une version quantitative d'un résultat de Furstenberg [20] et
Deligne [14]: la diagonale d'une série formelle algébrique de plusieurs variables à …

Let K be a field of positive characteristic. When V is a linear variety in Kn and G is a finitely
generated subgroup of K*, we show how to compute the set V∩ Gn effectively using heights …

Let K be an algebraically closed field of characteristic p. We exhibit a counterexample
against a theorem asserted in one of our earlier papers, which claims to characterize the …

We develop a new method for proving algebraic independence of $ G $-functions. Our
approach rests on the following observation: $ G $-functions do not always come with a …