| Author(s) | Title |
| Marco Almeida (Porto, Portugal), Nelma Moreira (Porto, Portugal), and Rogrio Reis (Porto, Portugal) | Testing the Equivalence of Regular Languages |
| Pierre-Yves Angrand (Paris, France), Sylvain Lombardy (Paris, France), and Jacques Sakarovitch (Paris, France) | On the Number of Broken Derived Terms of a Rational Expression |
| M. Sakthi Balan (Bangalore, India) | Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems |
| Fevzi Belli (Paderborn, Germany) and Mutlu Beyazit (Paderborn, Germany) | Mutation of Directed Graphs – Corresponding Regular Expressions and Complexity of Their Generation |
| Franziska Biegler (London, Canada), Mark Daley (London, Canada), and Ian McQuillan (Saskatoon, Canada) | On the Shuffle Automaton Size for Words |
| Erzsébet Csuhaj-Varjú (Budapest, Hungary) and György Vaszil (Budapest, Hungary) | On the Size Complexity of Non-Returning Context-Free PC Grammar Systems |
| Rudolf Freund (Vienna, Austria), Andreas Klein (Ghent, Belgium), and Martin Kutrib (Giessen, Germany) | On the Number of Membranes in Unary P Systems |
| Pierluigi Frisco (Edinburgh, United Kingdom) and Oscar H. Ibarra (Santa Barbara, USA) | On Languages Accepted by P/T systems Composed of Joins |
| Yuan Gao (London, Canada) and Sheng Yu (London, Canada) | State Complexity Approximation |
| Viliam Geffert (Košice, Slovakia) and Lubomíra Ištoňová (Košice, Slovakia) | Translation from Classical Two-Way Automata to Pebble Two-Way Automata |
| Hermann Gruber (Giessen, Germany), Markus Holzer (Giessen, Germany), and Martin Kutrib (Giessen, Germany) | On Measuring Non-Recursive Trade-Offs |
| Galina Jirásková (Košice, Slovakia) and Alexander Okhotin (Turku, Finland) | Nondeterministic State Complexity of Positional Addition |
| Martin Kutrib (Giessen, Germany) and Andreas Malcher (Giessen, Germany) | Bounded Languages Meet Cellular Automata with Sparse Communication |
| Remco Loos (Cambridge, United Kingdom), Florin Manea (Bucharest, Romania), and Victor Mitrana (Valencia, Spain) | Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections |
| Tomáš Masopust (Brno, Czech Republic) and Alexander Meduna (Brno, Czech Republic) | Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement |
| Ralf Stiebe (Magdeburg, Germany) and Sherzod Turaev (Tarragona, Spain) | Capacity Bounded Grammars and Petri Nets |