Accepted Papers
ordered by first author's name
| No. | Authors | Title |
| 1 | Artiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martin-Vide and Yurii Rogozhin | About Universal Hybrid Networks of Evolutionary Processors of Small Size |
| 2 | Jan-Henrik Altenbernd | On Bifix Systems and Generalizations |
| 3 | Terry Anderson, Narad Rampersad, Nicolae Santean and Jeffrey Shallit | Finite automata, palindromes, powers, and patterns |
| 4 | Pablo Arrighi, Vincent Nesme and Reinhard Werner | One-dimensional quantum cellular automata over finite, unbounded configurations. |
| 5 | Dorothea Baumeister and Jörg Rothe | The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions |
| 6 | Denis Bechet, Alexander Dikovsky, Annie Foret and Emmanuelle Garel | Optional and Iterated Types for Pregroup Grammars |
| 7 | Florent Becker | Transformations and preservation of self-assembly dynamics through homotheties |
| 8 | Suna Bensch, Henning Bordihn, Markus Holzer and Martin Kutrib | Deterministic Input-Reversal and Input-Revolving Finite Automata |
| 9 | Henning Bordihn and Markus Holzer | Random Context in Regulated Rewriting {\it Versus\/} Cooperating Distributed Grammar Systems |
| 10 | Robert Brijder and Hendrik Jan Hoogeboom | Extending the Overlap Graph for Gene Assembly in Ciliates |
| 11 | Alan J Cain, Graham P Oliver, Nik Ruskuc and Rick Thomas | Automatic Presentations for Cancellative Semigroups |
| 12 | Silvio Capobianco | Induced Subshifts and Cellular Automata |
| 13 | Giusi Castiglione, Antonio Restivo and Marinella Sciortino | Hopcroft's Algorithm and Cyclic Automata |
| 14 | Jérôme Champavčre, Rémi Gilleron, Aurélien Lemay and Joachim Niehren | Efficient Inclusion Checking for Deterministic Tree Automata and DTDs |
| 15 | Stefano Crespi Reghizzi and Pierluigi San Pietro | Consensual definition of languages by regular sets |
| 16 | Jürgen Dassow and Sherzod Turaev | k-Petri Net Controlled Grammars |
| 17 | Pawel Gawrychowski and Andrzej Kisielewicz | 2-Synchronizing Words |
| 18 | Mathieu Giraud | Not so many runs in strings |
| 19 | LE Hong Phuong, Azim Roussanaly, Thi Minh Huyen Nguyen and Tuong Vinh HO | A Hybrid Approach to Word Segmentation of Vietnamese Texts |
| 20 | Ozan Kahramanogullari | On Linear Logic Planning and Concurrency |
| 21 | Laura Kallmeyer and Yannick Parmentier | On the relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG) |
| 22 | Claude Kirchner, Radu Kopetz and Pierre-Etienne Moreau | Anti-Pattern Matching Modulo |
| 23 | Sergey Kitaev, Toufik Mansour and Patrice Seebold | Counting ordered patterns in words generated by morphisms |
| 24 | Ondrej Klima and Libor Polak | Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups |
| 25 | Barbara Klunder | Characterization of Star-Connected Languages using Finite Automata |
| 26 | Martin Korp and Aart Middeldorp | Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems |
| 27 | Alexander Krassovitskiy, Yurii Rogozhin and Sergey Verlan | Further results on insertion-deletion systems with one-sided contexts |
| 28 | Peter Leupold | On Regularity-Preservation by String-Rewriting Systems |
| 29 | Andreas Maletti | Minimizing Deterministic Weighted Tree Automata |
| 30 | Mark Mercer | Lower Bounds for Generalized Quantum Finite Automata |
| 31 | Wlodzimierz Moczurad and Malgorzata Moczurad | How many figure sets are codes? |
| 32 | Friedrich Otto and Etsuro Moriya | On Alternating Non-Context-Free Grammars |
| 33 | Friedrich Otto and Martin Platek | A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata |
| 34 | Alexander Perekrestenko | Minimalist Grammars with unbounded scrambling and nondiscriminating barriers are NP-hard |
| 35 | Holger Petersen | Sorting and Element Distinctness on One-Way Turing Machines |
| 36 | Svetlana Puzynina | On periodicity of generalized two-dimensional words |
| 37 | Damien Regnault, Nicolas Schabanel and Eric Thierry | On the analysis of ''simple'' 2D stochastic cellular automata |
| 38 | Elaine Render and Mark Kambites | Polycyclic and bicyclic valence automata |
| 39 | Arto Salomaa, Kai Salomaa and Sheng Yu | Length codes, products of languages and primality |
| 40 | Ryo Yoshinaka | An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs |