arXiv · 2308.10977
An elementary proof of Bridy's theorem
Abstract
Christol's theorem states that a power series with coefficients in a finite field is algebraic if and only if its coefficient sequence is automatic. A natural question is how the size of a polynomial describing such a sequence relates to the size of an automaton describing the same sequence. Bridy used tools from algebraic geometry to bound the size of the minimal automaton for a sequence, given its minimal polynomial. We produce a new proof of Bridy's bound by embedding algebraic sequences as diagonals of rational functions.
Explore related subjects
Keep this discovery
Eric Rowland, Manon Stipulanti, Reem Yassawi. 2023-08-21. An elementary proof of Bridy's theorem. https://doi.org/10.1016/j.ffa.2025.102621
Cite the original work for its findings. Save a collection to share your selection of sources.