| Authors |
Title |
Article |
Slides |
| Pierre Arnoux, Valérie Berthé, Anne Siegel
| Generations of discrete planes
| pdf | pdf |
| Vince Bárány
| A hierarchy of automatic omega-words having a decidable MSO theory
| pdf | pdf |
| Marie-Pierre Béal, Fabio Burderi, Antonio Restivo
| Regular coding partitions
| pdf | pdf |
| Nicolas Bedaride
| Directional complexity of hypercubic billiard
| pdf | pdf |
| Aleksandrs Belovs
| Some algebraic properties of machine poset of infinite words
| pdf | X |
| Jean Berstel
| Arbres sturmiens
| pdf | pdf |
| Jean-Pierre Borel
| Computing finite standard billiard words by decimations
| X | X |
| Laurent Braud
| Higher-order schemes and morphic words
| pdf | pdf |
| Janis Buls, Aivars Lorencs
| From bi-ideals to periodicity
| pdf | pdf |
| Benoit Cagnard, Christian Morelli, Pierre Simonnet
| Remarques d'automaticiens sur le théorème de Sarkovski
| pdf | X |
| Jérémie Chalopin, Pascal Ochem
| Dejean's conjecture and letter frequency
| pdf | pdf |
| Emilie Charlier, Michel Rigo
| Structural properties of bounded languages with respect to multiplication by a constant
| pdf | pdf |
| Laura Chaubard, Alfredo Costa
| A new algebraic invariant for weak equivalence of sofic subshifts
| pdf | pdf |
| Eugen Czeiler, Jarkko Kari
| On testing the equality of sofic systems
| pdf | pdf |
| Giovanna D'Agostino, Angelo Montanari, Alberto Policritti,
| Extensions of S1S and the composition method
| pdf | pdf |
| Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre
| Efficient validation and construction of border arrays
| pdf | pdf |
| Severine Fratani
| The theory of successor extended by severals predicates
| pdf | pdf |
| Laura Giambruno, Antonio Restivo
| An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
| pdf | X |
| Alain Hertzog, Pierre Simonnet
| Witold Hurewicz et les automates
| pdf | X |
| Stepán Holub
| Parikh test sets for commutative languages
| pdf | pdf |
| Raphael Jungers, Vincent Blondel
| Cruisable graphs
| pdf | X |
| Tomi Karki
| Compatibility relations on codes and free monoids
| pdf | pdf |
| Daniel Kirsten
| A Burnside approach to the termination of Mohri's algorithm for polynomially ambiguous min-plus-automata
| pdf | pdf |
| Ondrej Klima, Libor Polák
| On varieties of literally idempotent languages
| pdf | pdf |
| Marion Le Gonidec
| Propriétés des mots infinis engendrés par des systèmes automatiques
| X | X |
| Barnaby Martin
| Dichotomies and duality in first-order model checking problems
| pdf | pdf |
| Christian Mauduit
| Automates infinis et théorie des nombres
| X | X |
| Antoine Meyer
| Traces of term-automatic graphs
| pdf | pdf |
| Christophe Morvan
| Classes of rational graphs
| pdf | pdf |
| Geneviève Paquin, Srecko Brlek, Damien Jamet
| Extremal generalized smooth words
| pdf | pdf |
| Elise Prieur, Thierry Lecroq
| On-line construction of compact suffix vectors and maximal repeats
| pdf | pdf |