Christol's theorem
Automatic sequences and formal algebraic series
Article REF: AF175 V1
Christol's theorem
Automatic sequences and formal algebraic series

Author : Jean-Paul ALLOUCHE

Publication date: October 10, 2005 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

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 1 . Let Fq...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

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?


Article included in this offer

"Mathematics"

( 165 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details