4. Christol's theorem
In this section, we will show Christol's theorem, which states the equivalence between the algebraicity of a formal series with coefficients in a finite field and the automaticity of the sequence of its coefficients: in other words, on a finite field, a combinatorial property of the sequence of coefficients of a formal series (the fact of being generated by a finite automaton) allows us to detect the algebraic character of this formal series.
Theorem 2. Let q = p a , with p prime and a integer
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
The Ultimate Scientific and Technical Reference
This article is included in
Mathematics
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Christol's theorem
References
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
The Ultimate Scientific and Technical Reference