Monday, June 17
10:00 AM-12:00 PM
Room 303

Automatic Sequences

Automatic sequences (generated by finite automata) can be studied from the point of view of mathematics, computer science or physics. One of the most important results is the theorem of Christol, Kamae, Mendes France, and Rauzy (1980) which shows the equivalence between a language-theoretic (or even combinatorial) property of a sequence (being q-automatic) and an algebraic property of the associated formal power series in F_q[[X]] (being algebraic over the field F_q(X)).

The speakers will discuss recent results in transcendence theory (in particular for the Carlitz functions), in theoretical computer science (combinatorics on words) and in the physics of disorder (quasicrystals).

Organizer:Jean-Paul Allouche
CNRS, France

10:00 Automatic Sequences and Applications
Jean-Paul Allouche, Organizer
10:30 Transcendence of the Values of the Carlitz Functions
Valerie Berthe, CNRS, France
11:00 Continued Fractions and Automatic Sequences
Jeffrey Shallit, University of Waterloo, Canada
11:30 Invertible Morphisms
Zhi-Ying Wen, Wuhan University, People's Republic of China

Registration | Hotel Information | Dormitory Information | Transportation | Speaker Index

MEM, 3/21/96