The conference program includes 6 plenary talks
and 36 selected communications.
The abstracts of invited lectures and of accepted papers
can be downloaded here
(last update: July 24, 2009).
 M. Crochemore (joint work with L. Ilie and L. Tinta)
The "runs" conjecture
 A. Fraenkel
Unbounded Iterations of Floor Functions and the Flora Game
 R. Grossi
Combinatorics on (compressed) suffix arrays
 A. Restivo
BurrowsWheeler Transform and Balanced Words
 C. Reutenauer (joint work with I. Assem and D. Smith)
SL_{2} tilings
 J. Shallit (joint work with N. Rampersad and Z. Xu)
The computational complexity of universality problems
for prefixes, suffixes, factors, and subwords of regular languages
(ordered by submission number)
 S. V. Avgustinovich, A. Frid and T. Kamae
Infinite permutations of lowest maximal pattern complexity
 H. UsckaWehlou
Sturmian words with balanced construction
 A. Juhasz
An application of word combinatorics to the membership problem for
subsemigroups of onerelator groups
 P. Ambro, Z. Masáková and E. Pelantová
Substitutions fixing words associated with exchange of three intervals
 Y. Bugeaud, D. Krieger and J. Shallit
Morphic and Automatic Words: Maximal Blocks and Diophantine Approximation
 P. Ambro, A. Frid, Z. Masáková and E. Pelantová
Enumeration of 3iet factors
 D. Merlini and R. Sprugnoli
Algebraic aspects of some Riordan arrays related to binary words
avoiding a pattern
 F. BlanchetSadri and B. Shirey
Periods and Binary Partial Words
 M.Arfi, B. Ould M Lemine and C. Selmi
Mixed strategies and closed sets of infinite words
 L. Balková, E. Pelantová and S. Starosta
Palindromes in infinite ternary words
 T. Kärki, A. Lacroix and M. Rigo
On the recognizability of selfgenerating sets
 E. Duchęne and M. Rigo
Invariant Games
 M. Rao
Last Cases of Dejean's Conjecture
 R. Dabrowski and W. Plandowski
Complete characterization of zeroexpressible functions
 V. Vajnovszki
A new EulerMahonian constructive bijection
 F. Fiorenzi and P. Ochem
More on generalized repetition thresholds
 S. Brocchi, A. Frosini, R. Pinzani and S. Rinaldi
On the tiling recognizability of Lconvex polyominoes
 G. Richomme, K. Saari and L. Q. Zamboni
Abelian Properties of Words (Extended abstract)
 O. Klíma
Piecewise Testable Languages via Combinatorics on Words
 D. Jamet, G. Paquin, G. Richomme and L. Vuillon
On the fixed points of the iterated pseudopalindromic closure
 F. D'Alessandro, B. Intrigila and S. Varricchio
On some counting problems for semilinear sets
 X. Provençal
NonConvex Words
 S. Puzynina
On padic avoidance of words
 A. Blondin Massé, S. Brlek, A. Garon and S. Labbé
Palindromes and local periodicity
 S. Crespi Reghizzi and D. Mandrioli
Algebraic properties of structured contextfree languages: old approaches and novel developments
 F. BlanchetSadri, R. Mercas and K. Wetzler
The ThreeSquares Lemma for Partial Words with One Hole
 M. Anselmo and M. Madonia
Some results on unary unambiguous automata
 E. Vaslet
Bounds for the generalized repetition threshold
 J.P. Borel
Digital Straight Lines and Billiard Words
 L. Breveglieri, S. Crespi Reghizzi and M. Goldwurm
Efficient recognition of trace languages defined by repeatuntil loops
 S. Lombardy and J. Sakarovitch
Radix crosssections for length morphisms
 S. Julia and T. Vinh Duc
Families and wambiguity removal
 S. Holub and J. Kortelainen
On partitions separating two words
 M. Dominguez and T. Noll
A Specific Extension of ChristoffelDuality to a Certain Class of Sturm Numbers and their Characteristic Words
 I. A. Mikhailova
Pattern avoidance by antichains
 D. Clampitt and T. Noll
Pairwise Wellformed Words
