Full papers
Click on the title for the abstract.
- Giovanni Battaglia, Roberto Grossi and Noemi Scutellà, Counting the orderings for multisets in consecutive ones property and PQ-trees
- Francine Blanchet-Sadri and Sean Simmons, Avoiding abelian powers in partial words
- Paola Bonizzoni and Natasha Jonoska, Regular splicing languages must have a constant
- Sabine Broda, António Machiavelo, Nelma Moreira and Rogério Reis, The average transition complexity of Glushkov and partial derivative automata
- Janusz Brzozowski and Hellis Tamm, Theory of Átomata
- Janusz Brzozowski and Yuli Ye, Syntactic complexity of ideal and closed languages
- Pascal Caron, Yo-Sub Han and Ludovic Mignot, Generalized one-unambiguity
- Gérard Cécé and Alain Giorgetti, Simulations over two-dimensional on-line tessellation automata
- Peter Černo and František Mráz, Δ-clearing restarting automata and CFL
- Émilie Charlier, Narad Rampersad and Jeffrey Shallit, Enumeration and decidable properties of automatic sequences
- Namit Chaturvedi, Jörg Olschewski and Wolfgang Thomas, Languages vs. ω-languages in regular infinite games
- Volker Diekert and Alexei Myasnikov, Solving word problems in group extensions over infinite words
- Michael Domaratzki and Narad Rampersad, Abelian primitive words
- Zoltán Ésik, Scattered context-free linear orderings
- Gabriele Fici and Zsuzsanna Lipták, On prefix normal words
- Vladimir V. Gusev and Elena V. Pribavkina, On non-complete sets and Restivo’s conjecture
- Benjamin Hellouin de Menibus and Mathieu Sablik, Self-organization in cellular automata: A particle-based approach
- Markus Holzer and Sebastian Jakobi, Chop operations and expressions: Descriptional complexity considerations
- Markus Holzer, Martin Kutrib, and Ursula Leiter, Nodes connected by path languages
- Norbert Hundeshagen and Friedrich Otto, Characterizing the regular languages by nonforgetting restarting automata
- Oscar H. Ibarra and Hsu-Chun Yen, On two-way transducers
- Juha Kortelainen and Tuukka Salmi, There does not exist a minimal full trio with respect to bounded context-free languages
- Michal Kunc and Alexander Okhotin, Describing periodicity in two-way deterministic finite automata using transformation semigroups
- Florin Manea, Deciding networks of evolutionary processors
- Roberto Mantaci and Paolo Massazza, From linear partitions to parallelogram polyominoes
- Narad Rampersad and Elise Vaslet, On highly repetitive and power free words
- Edita Pelantová and Štěpán Starosta, Infinite words rich and almost rich in generalized palindromes
- Andrey N. Plyushchenko and Arseny M. Shur, On Brzozowski’s conjecture for the free Burnside semigroup satisfying x² = x³
- Emanuele Rodaro and Pedro V. Silva, Never minimal automata and the rainbow bipartite subgraph problem
- Victor Selivanov and Anton Konovalov, Boolean algebras of regular languages
- Jeffrey Shallit, Fife’s theorem revisited
- Nuri Taşdemir and A.C. Cem Say, Models of pushdown automata with reset
- Ryo Yoshinaka, Towards dual approaches for learning context-free grammars based on syntactic concept lattices
- Georg Zetzsche, A sufficient condition for erasing productions to be avoidable
Posters
- Daniela Battaglino, Jean Marc Fedou, Andrea Frosini and Simone Rinaldi, Encoding centered polyominoes by means of a regular language
- Jérôme Chandesris, Alberto Dennunzio, Enrico Formenti and Luca Manzoni, Computational aspects of asynchronous cellular automata
- Alessandra Cherubini, Achille Frigeri and Brunetto Piochi, Short 3-collapsing words over a 2-letter alphabet
- Manfred Droste, Ingmar Meinecke, Branimir Šešelja and Andreja Tepavčević, A cascade decomposition of weighted finite transition systems
- Kaoru Fujioka, Morphic characterizations in terms of insertion systems with a context of length one
- Anna Kasprzik, Inference of residual finite-state tree automata from membership queries and finite positive data
- Sergey Kitaev, Pavel Salimov, Christopher Severs and Henning Úlfarsson, On the representability of line graphs
