Algebraic Generalized Power Series and Automata
classification
🧮 math.AC
keywords
powerseriesalgebraicchristolfinitegeneralizedsetsarbitrary
read the original abstract
A theorem of Christol states that a power series over a finite field is algebraic over the polynomial ring if and only if its coefficients can be generated by a finite automaton. Using Christol's result, we prove that the same assertion holds for generalized power series (whose index sets may be arbitrary well-ordered sets of nonnegative rationals).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.