| 2004 | On Codes Defined by Bio-Operations. | Mark Daley, Michael Domaratzki |
| 2004 | Avoidable Sets and Well Quasi-Orders. | Flavio D'Alessandro, Stefano Varricchio |
| 2004 | Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey. | Bruno Courcelle |
| 2004 | On the Maximum Coefficients of Rational Formal Series in Commuting Variables. | Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati |
| 2004 | Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. | Henning Bordihn, Markus Holzer, Martin Kutrib |
| 2004 | The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. | Bernd Borchert, Klaus-Jrn Lange, Frank Stephan, Pascal Tesson, Denis Thrien |
| 2004 | On Competence in CD Grammar Systems. | Maurice H. ter Beek, Erzsbet Csuhaj-Varj, Markus Holzer, Gyrgy Vaszil |
| 2004 | Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet. | Marcella Anselmo, Dora Giammarresi, Maria Madonia |
| 2003 | Complexity Theory Made Easy. | Heribert Vollmer |
| 2003 | Tile Rewriting Grammars. | Stefano Crespi-Reghizzi, Matteo Pradella |
| 2003 | Alphabetic Pushdown Tree Transducers. | George Rahonis |
| 2003 | Syntactic Semiring and Universal Automaton. | Libor Polk |
| 2003 | Test Sets for Large Families of Languages. | Wojciech Plandowski |
| 2003 | Restarting Automata and Their Relations to the Chomsky Hierarchy. | Friedrich Otto |
| 2003 | Boolean Grammars. | Alexander Okhotin |
| 2003 | Minimizing Finite Automata Is Computationally Hard. | Andreas Malcher |
| 2003 | Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton. | Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur |
| 2003 | Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. | Markus Holzer, Martin Kutrib |
| 2003 | On Deterministic Finite Automata and Syntactic Monoid Size, Continued. | Markus Holzer, Barbara Knig |
| 2003 | Deleting String Rewriting Systems Preserve Regularity. | Dieter Hofbauer, Johannes Waldmann |
| 2003 | Computation with Absolutely No Space Overhead. | Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau |
| 2003 | About Duval's Conjecture. | Tero Harju, Dirk Nowotka |
| 2003 | On a Conjecture of Schnoebelen. | Antonio Cano Gmez, Jean-Eric Pin |
| 2003 | Computing Languages by (Bounded) Local Sets. | Dora Giammarresi |
| 2003 | Comments on Complete Sets of Tree Automata. | Ferenc Gcseg |