Programme

The programme is available at the bottom of this page or as a pdf file. Only the first author is listed, complete information about each contributed talk is given below. Note that the first three talks of Wednesday 10th are dedicated to the memory of Stefano Varricchio.

A social event consisting in visiting an old coal mine will be organized on Wednesday 10th June (in the afternoon). Details will be given during the conference.

A conference dinner will be organized on Thursday 11th June.

Le Labo 4
quai van Beneden 22
4020 Liège
(Next to the Aquarium and the Kennedy bridge)

List of accepted contributions

• Pavel Salimov. On Uniform Recurrence of a Direct Product
• Farida Benmakrouha, Christiane Hespel and Edouard Monnier. About the decomposition of a finite weighted automaton into simple weighted automata
• Evgeny Skvortsov and Yulia Zaks. Synchronizing random automata
• Raymond Devillers. The Prime Game for a few representations
• Flavio D'alessandro, Benedetto Intrigila and Stefano Varricchio. On the Parikh functions of sparse context-free languages
• Abuzer Yakaryilmaz and A.C. Cem Say. Succinctness of two-way probabilistic and quantum finite automata
• Christophe Morvan and Sophie Pinchinat. Diagnosability of Pushdown Systems
• Libor Polak and Ondrej Klima. Subhierarchies of the Second Level in the Straubing-Thérien Hierarchy
• Lesha Khvorost. Computing All Pure Squares in Compressed Texts
• Wit Forys and Piotr Oprocha. Infinite Traces and Symbolic Dynamics - substitution shift case
• Paola Bonizzoni, Clelia de Felice and Rosalba Zizza. On circular semi-simple splicing systems
• Olga Brukman and Shlomi Dolev. Self-* Programming: Run-Time Parallel Control Search for Reflection Box
• Krishnendu Chatterjee, Laurent Doyen and Thomas Henzinger. Quantitative Languages
• Emilie Charlier, Tomi Karki and Michel Rigo. Multidimensional Generalized Automatic Sequences and Shape-Symmetric Morphic Words
• Christian Choffrut and Robert Mercas. Contextual partial commutations
• Paul Bell, Jean-Charles Delvenne, Raphael Jungers and Vincent blondel. The Continuous Skolem-Pisot Problem
• Juhani Karhumaki and Aleksi Saarela. Noneffective Regularity of Equality Languages and Bounded Delay Morphisms
• Olivier Gauwin, Joachim Niehren and Sophie Tison. Earliest Query Answering for Deterministic Nested Word Automata
• Wolfgang Thomas, Michaela Slaats and Paul Hänsch. Parametrized Infinite Games and Higher-Order Pushdown Strategies
• Jorge Almeida, José Carlos Costa and Marc Zeitoun. Some structural properties of the free profinite aperiodic semigroup
• Balder ten Cate. A note on the expressibility problem for modal logics and star-free regular expressions
• Bernard Boigelot, Julien Brusten, Jérôme Leroux, A generalization of Semenov's Theorem to Automata over Real Numbers