An infinite sequence (a n ) n≥0 over a finite alphabet A is k-automatic for an integer k ≥ 2 if it can be generated by a finite automaton which reads the representation in base k of a non-negative integer n from right to left and outputs an element a n in A. It is called automatic if it is k-automatic for some integer k ≥ 2. In 1968, Cobham [14] conjectured that, for any integer b ≥ 2, the base-b expansion of an irrational real number never forms an automatic sequence. This was confirmed in 2007 by Adamczewski and Bugeaud [1] (see [30,3] for alternative proofs), who also established that if the Hensel expansion of an irrational p-adic number ξ is an automatic sequence, then ξ is transcendental. In a similar spirit, Bugeaud [10] proved that the sequence of partial quotients of an algebraic real number of degree at least 3 never forms an automatic sequence.Analogous questions can be asked for power series over a finite field, but the answers are different. Throughout the paper, we let q denote a power of a prime number p, and F q denote the field with q elements. In 1979 established that a power series in F q ((z −1 )) is algebraic over F q (z) if and only if the sequence of its coefficients is q-automatic (or equivalently p-automatic).In analogy with the continued fraction algorithm for real numbers, there is a well-studied continued fraction algorithm for power series in F q ((z −1 )), the partial quotients being non-constant polynomials in F q [z]. In both settings, eventually periodic expansions correspond to quadratic elements, but much more is known on the continued fraction expansion of algebraic power