Accepted Papers
- Kostyantyn ARCHANGELSKY
A new representation of weighted finite automata via recurrence
and group rings
- Pierre ARNOUX, Valérie BERTHÉ, Anne SIEGEL
Finiteness properties for Pisot S-adic tilings
- Vince BÁRÁNY
A hierarchy of automatic words having a decidable MSO theory
- Marie-Pierre BÉAL, Fabio BURDERI, Antonio RESTIVO
Regular coding partitions
- Nicolas BEDARIDE
Directional complexity of hypercubic billiard
- Aleksandrs BELOVS
Some algebraic properties of machine poset of infinite words
- Jean-Pierre BOREL
Computing finite Sturmian words by decimations
- Laurent BRAUD
Higher-order schemes and morphic words
- Janis BULS, Aivars LORENCS
From bi-ideals to periodicity
- Benoit CAGNARD, Christian MORELLI, Pierre SIMONNET
Remarques d'automaticiens sur le théorème de Sarkovski
- Jérémie CHALOPIN, Pascal OCHEM
Dejean's conjecture and letter frequency
- Émilie CHARLIER, Michel RIGO
Structural properties of bounded languages with respect to
multiplication by a constant
- Laura CHAUBARD, Alfredo COSTA
A new algebraic invariant for weak equivalence of sofic subshifts
- Eugen CZEIZLER, Jarkko KARI
On testing the equality of sofic systems
- Giovanna D'AGOSTINO, Angelo MONTANARI, Alberto POLICRITI
Extensions of S1S and the composition method
- Jean-Pierre DUVAL, Thierry LECROQ, Arnaud LEFEBVRE
Efficient validation and construction of border arrays
- Séverine FRATANI
The theory of successor extended by several predicates
- Laura GIAMBRUNO, Antonio RESTIVO
An automata-theoretic approach to the study of the intersection
of two submonoids of a free monoid
- Alain HERTZOG, Pierre SIMONNET
Witold Hurewicz et les automates
- Stepán HOLUB
Parikh test sets for commutative languages
- Raphaël JUNGERS, Vincent BLONDEL
Cruisable graphs
- Tomi KÄRKI
Compatibility relations on codes and free monoids
- Daniel KIRSTEN
A Burnside approach to the termination of Mohri's algorithm
for polynomially ambiguous min-plus-automata
- Wit FORYS, Janusz MATYJA
Equality of measure and topological entropy for some cellular automata
- Ondrej KLÍMA, Libor POLÁK
On varieties of literally idempotent languages
- Marion LE GONIDEC
Complexité de mots infinis engendrés par des automates dénombrables
- Barnaby MARTIN
Dichotomies and duality in first-order model checking problems
- Christian MAUDUIT
Automates infinis et théorie des nombres
- Antoine MEYER
Traces of term-automatic graphs
- Christophe MORVAN
Classes of rational graphs
- Geneviève PAQUIN, Srecko BRLEK, Damien JAMET
Extremal generalized smooth words
- Thi Ha Duong PHAN
Unimodal sequences and discrete dynamical models
- Élise PRIEUR, Thierry LECROQ
On-line construction of compact suffix vectors and maximal repeats
- Alexander RABINOVICH, Refael MEIROVICH
Decidability of monadic logic over sparse predicate
- Arseny SHUR
Comparing complexity functions of a language and its extendable part
|
|
