| 8:55 |
Opening of the
workshop |
| session 1 (chair:
Gwénaël Richomme) |
|
| 9:00 | Invited talk:
Jeffrey Shallit Avoidability in Words: Recent Results and Open Problems |
| 10:00 | Uniformly
n-Bounded Duplication Codes Peter Leupold |
| 10:30 | Coffee break |
| session 2 (chair: Arturo Carpi) |
|
| 11:00 | Squares and
Overlaps in the
Thue-Morse Sequence and Some Variants Shandy Brown, Narad Rampersad, Jeffrey Shallit and Troy Vasiga |
| 11:30 | The number of
ternary words
avoiding abelian cubes grows exponentially, Ali Aberkane, James D. Currie and Narad Rampersad |
| 12:00 | Avoidable
sets and well
quasi-orders Flavio D'Alessandro, Stefano Varrichio |
| 12:30 | Lunch |
| session 3 (chair: Julien
Cassaigne) |
|
| 14:00 | Invited talk:
Anna E. Frid Possible growth of arithmetical complexity |
| 15:00 | Transcendence
of numbers with
an expansion in a subclass of complexity 2n+1 Tomi Kärki |
| 15:30 | Factorization
of
mechanical words and continued fractions Bruno Gaujal, Emmanuel Hyon |
| 16:00 | Coffee break |
| session 4 (chair: Ion Petre) |
|
| 16:30 | Characterization
of Infinite Solutions of Marked
Post Correspondence Problem Vesa Halava, Tero Harju, Juhani Karhumäki |
| 17:00 | A
generator of morphisms for
infinite words Pascal Ochem |