(alphabetically ordered)
| 96 | Parosh Abdulla, Giorgio Delzanno and Laurent Van Begin | A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations |
| 102 | Sergey Afonin and Denis Golomazov | Minimal Union-free Decompositions of Regular Languages |
| 82 | Yohji Akama | Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory |
| 21 | Franz Baader, Andreas Bauer and Alwen Tiu | Matching trace patterns with regular policies |
| 92 | Tobias Berg and Harald Hempel | Reoptimization of Traveling Salesperson Problems: Changing single edge-weights |
| 87 | Nathalie Bertrand, Sophie Pinchinat and Jean-Baptiste Raclet | Refinement and Consistency of Timed Modal Specifications |
| 14 | Olaf Beyersdorff, Johannes Koebler and Sebastian Mueller | Nondeterministic Instance Complexity and Proof Systems with Advice |
| 15 | Francine Blanchet-Sadri, Emily Allen, Cameron Byrum and Robert Mercas | How many holes can an unbordered partial word contain? |
| 11 | Francine Blanchet-Sadri, Robert Mercas, Abraham Rashin and Elara Willett | An answer to a conjecture on overlaps in partial words using periodicity algorithms |
| 62 | Bernard Boigelot and Jean-François Degbomont | Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization |
| 79 | Beate Bollig | Larger lower bounds on the OBDD complexity of integer multiplication |
| 90 | Paola Bonizzoni, Claudio FERRETTI, Anthonath Roslin Sagaya Mary and Giancarlo Mauri | Picture languages generated by assembling tiles |
| 77 | Henning Bordihn, Markus Holzer and Martin Kutrib | Undecidability of Operation Problems for T0L Languages and Subclasses |
| 12 | Janusz Brzozowski, Jeffrey Shallit and ZHI XU | Decision Problems For Convex Languages |
| 104 | Michelangelo Bucci and Alessandro De Luca | On a family of morphic images of Arnoux-Rauzy words |
| 106 | Benjamin Carle and Paliath Narendran | On Extended Regular Expressions |
| 85 | Pascal Caron, Jean-Marc Champarnaud and Ludovic Mignot | Multi-tilde operators and their Glushkov automata |
| 113 | Gianpiero Cattaneo, Alberto Dennunzio, Enrico Formenti and Julien Provillard | Non-Uniform Cellular Automata |
| 34 | Adam Clarridge and Kai Salomaa | A Cryptosystem Based on the Composition of Reversible Cellular Automata |
| 75 | Jürgen Dassow and Sherzod Turaev | Sub-Petri Net Controlled Grammars |
| 60 | François Denis and Raphael Bailly | Absolute Convergence of Rational Series is Semi-decidable |
| 36 | Kimmo Fredriksson and Szymon Grabowski | Nested counters in bit-parallel string matching |
| 58 | Olivier Gauwin, Joachim Niehren and Sophie Tison | Bounded Delay and Concurrency for Earliest Query Answering |
| 110 | Nina Gierasimczuk | Learning by Erasing in Dynamic Epistemic Logic |
| 35 | Christian Glasser, A Pavan and Stephen Travers | The Fault Tolerance of NP-Hard Problems |
| 64 | Isabelle Gnaedig | Termination of Priority Rewriting |
| 41 | Yo-Sub Han, Kai Salomaa and Sheng Yu | State Complexity of Combined Operations for Prefix-Free Regular Languages |
| 40 | Kees Hemerik | Towards a Taxonomy for ECFG and RRPG Parsing |
| 43 | Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda | Counting Parameterized Border Arrays for a Binary Alphabet |
| 25 | Masami Ito, Peter Leupold and Victor Mitrana | Bounded Hairpin Completion |
| 50 | Florent Jacquemard, Francis Klay and Camille Vacher | Rigid Tree Automata |
| 38 | Galina Jiraskova and Giovanni Pighizzini | Converting Self-Verifying Automata into Deterministic Automata |
| 4 | Anna Kasprzik | Two Equivalent Regularizations for Tree Adjoining Grammars |
| 76 | Andreas Krebs, Christoph Behle and Stephanie Reifferscheid | Non-Solvable Groups are not in FO+MOD+MAJ_2[REG] |
| 32 | Aude Liefooghe, Hélcne Touzet and Jean-Stéphane Varré | Self-overlapping occurrences and Knuth-Morris-Pratt algorithm for weighted matching |
| 59 | Nutan Limaye and Meena Mahajan | Membership testing: Removing extra stacks from multi-stack pushdown automata |
| 100 | Alexei Lisitsa, Igor Potapov and Rafiq Saleh | Automata on Gauss Words |
| 119 | Jiamou Liu and Mia Minnes | Analysing Complexity in Classes of Automatic Structures |
| 98 | Marketa Lopatkova and Tomas Holan | Segmentation Charts for Czech -- Relations among Segments in Complex Sentences |
| 3 | Tomas Masopust | A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions |
| 63 | Ryuichi Matoba, Makoto Nakamura and Satoshi Tojo | Efficiency of the Symmetry Bias in Grammar Aquisition |
| 108 | Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai and Ayumi Shinohara | A series of run-rich strings |
| 37 | Victor Mitrana and Bianca Truthe | On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes |
| 107 | Neil Moore | The halting problem and undecidability of document generation under access control for tree updates |
| 47 | Makoto Nakamura, Takashi Hashimoto and Satoshi Tojo | Prediction of Creole Emergence in Spatial Language Dynamics |
| 65 | Cyril Nicaud | On the average size of Glushkov's automata |
| 94 | Nicolas Ollinger | Tiling the Plane with a Fixed Number of Polyominoes |
| 16 | Kaoru Onodera | New Morphic Characterizations of Languages in Chomsky Hierarchy using Insertion and Locality |
| 27 | Dana Pardubska, Martin Platek and Friedrich Otto | On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata |
| 33 | Elena Pribavkina and Emanuele Rodaro | Finitely Generated Synchronizing Automata |
| 53 | Adam Roman | Genetic algorithm for synchronization |
| 19 | Paul Salimov | Constructing infinite words of intermediate arithmetical complexity |
| 99 | Celine Scornavacca, Vincent Berry and Vincent Ranwez | From gene trees to species trees through a supertree approach |
| 26 | Lutz Strassburger | A Kleene Theorem for Forest Languages |
| 49 | Torsten Stüber and Matthias Büchse | Monadic Datalog Tree Transducers |
| 73 | P.Vijay Suman and Paritosh Pandya | Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions |
| 67 | Oscar Valero and Jordi Llull-Chavarria | An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words |
| 84 | Sicco Verwer, Mathijs de Weerdt and Cees Witteveen | One-clock deterministic timed automata are efficiently identifiable in the limit |