Geodesic
Finite automata and arithmetic
Séminaire lotharingien de combinatoire, Tome 30 (1993)

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

The notion of sequence generated by a finite automaton, (or more precisely a finite automaton with output function, i.e., a "uniform tag system") has been introduced and studied by Cobham in 1972. In 1980, Christol, Kamae, Mendès France and Rauzy proved that a sequence with values in a finite field is automatic if and only if the related formal power series is algebraic over the rational functions with coefficients in this field: this was the starting point of numerous results linking automata theory, combinatorics and number theory. Our aim is to survey some results in this area, especially transcendence results, and to provide the reader with examples of automatic sequences. We will also give a bibliography where more detailed studies can be found. 

@article{SLC_1993_30_a2,
     author = {J.-P. Allouche},
     title = {Finite automata and arithmetic},
     journal = {S\'eminaire lotharingien de combinatoire},
     publisher = {mathdoc},
     volume = {30},
     year = {1993},
     url = {http://geodesic.mathdoc.fr/item/SLC_1993_30_a2/}
}
TY  - JOUR
AU  - J.-P. Allouche
TI  - Finite automata and arithmetic
JO  - Séminaire lotharingien de combinatoire
PY  - 1993
VL  - 30
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SLC_1993_30_a2/
ID  - SLC_1993_30_a2
ER  - 
%0 Journal Article
%A J.-P. Allouche
%T Finite automata and arithmetic
%J Séminaire lotharingien de combinatoire
%D 1993
%V 30
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SLC_1993_30_a2/
%F SLC_1993_30_a2
J.-P. Allouche. Finite automata and arithmetic. Séminaire lotharingien de combinatoire, Tome 30 (1993). http://geodesic.mathdoc.fr/item/SLC_1993_30_a2/