Wednesday

Tuesday Wednesday Thursday Friday

Program table

9:00-10:00

Kai Salomaa

Descriptional Complexity of Nondeterministic Finite Automata

10:00-10:30

Coffee

10:30-11:30

Michal Kunc

What Do We Know about Language Equations?

11:30-12:00

Laurent Bienvenu, Mathieu Sablik

The dynamics of cellular automata in shift-invariant topologies

12:00-13:30

Lunch

13:30-14:00

Henning Bordihn, Markus Holzer, Martin Kutrib

Hairpin Finite Automata

14:00-14:30

Marie-Pierre Béal, Fabio Burderi, Antonio Restivo

Coding Partitions: Regularity, Maximality and Global Ambiguity

14:30-15:00

Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi

An efficient computation of the equation K-automaton of a regular K-expression

15:00-15:30

Coffee

15:30-16:00

Peter Leupold

Duplication Roots

16:00-16:30

Yuri Pritykin

On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases

16:30-17:00

Gwénaël Richomme

A Local Balance Property of Episturmian Words

17:00-17:30

Marinella Sciortino, Luca Zamboni

Suffix Automata and Standard Sturmian Words