Automatic sequences. Theory, applications, generalizations

By A. Poorten. Mathematics of Computation, 2005

742 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Dynamics for β-shifts and Diophantine approximation (2007, background): “We refer the reader to [6] for a definition of a finite automaton.”
On the complexity of algebraic numbers, II. Continued fractions (2005, background): “A nice reference on this topic is the book of Allouche and Shallit [6].”
Diophantine properties of real numbers generated by finite automata (2006, unknown): “…sequence is the ﬁxed point beginning with 0 of the following binary 2-uniform morphism: Theorem 2.2 thus implies that the irrationality measure of ξ b satisﬁes µ ( ξ b ) ≤ 20 (independently of the integer b ), since in that case d = k = m = 2 (the fact that m = 2 is for instance proved in [8]).”
A Generalised Skolem–Mahler–lech Theorem for Affine Varieties (2005, background): “Examples seem to indicate that in characteristic p > 0, these sets should be p-automatic sets [1].”