This day aims to review more than 30 years of research in mathemathics and theoretical computer science on P-automatic sequences. A P-automatic sequence is an infinite word generated by one of the simplest algorithmic machines, namely a finite complete deterministic automaton: its n-th term is obtained by feeding the automaton with the P-ary expansion of n. P-automatic sequences are highly structured without being necessarily periodic, with this structure inducing numerous connections with number theory or physics.
The event will take place from 9am to 5pm, on tuesday april 30, at the Institut Henri Poincaré (Paris), auditorium Hermite.
Please register. If you want to attend to the lunch, please register before march 31.
Image credit
The top-left figure is a partial view of the cover of the book Automatic Sequences by Jean-Paul Allouche and Jeffrey Shallit: this cover was designed by James F. Brisson, based on a morphism originally discovered by Jeff Haferman.
