Finite automata and algebraic extensions of function fields
Abstract
We give an automata-theoretic description of the algebraic closure of the rational function field Fq(t) over a finite field, generalizing a result of Christol. The description takes place within the Hahn-Mal'cev-Neumann field of "generalized power series" over Fq. Our approach includes a characterization of well-ordered sets of rational numbers whose base p expansions are generated by a finite automaton, as well as some techniques for computing in the algebraic closure; these include an adaptation to positive characteristic of Newton's algorithm for finding local expansions of plane curves. We also conjecture a generalization of our results to several variables.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.