| 5 | -- | 0 | Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe. Editorial |
| 7 | -- | 25 | Marco Almeida, Nelma Moreira, Rogério Reis. Testing the Equivalence of Regular Languages |
| 27 | -- | 51 | Pierre-Yves Angrand, Sylvain Lombardy, Jacques Sakarovitch. On the Number of Broken Derived Terms of a Rational Expression |
| 53 | -- | 70 | Franziska Biegler, Mark Daley, Ian McQuillan. On the Shuffle Automaton Size for Words |
| 71 | -- | 89 | Janusz A. Brzozowski. Quotient Complexity of Regular Languages |
| 91 | -- | 105 | Erzsébet Csuhaj-Varjú, György Vaszil. On the Descriptional Complexity of Context-Free Non-returning PC Grammar Systems |
| 107 | -- | 120 | Hermann Gruber, Markus Holzer, Martin Kutrib. On Measuring Non-recursive Trade-Offs |
| 121 | -- | 133 | Galina Jirásková, Alexander Okhotin. Nondeterministic State Complexity of Positional Addition |
| 135 | -- | 153 | Martin Kutrib, Andreas Malcher. One-Way Cellular Automata, Bounded Languages, and Minimal Communication |
| 155 | -- | 174 | Remco Loos, Florin Manea, Victor Mitrana. Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections |
| 175 | -- | 194 | Ralf Stiebe, Sherzod Turaev. Capacity-Bounded Grammars |