| 2003 | About Duval's Conjecture. Tero Harju, Dirk Nowotka |
| 2003 | Alphabetic Pushdown Tree Transducers. George Rahonis |
| 2003 | An Automata-Theoretic Approach to Software Verification. Javier Esparza |
| 2003 | Boolean Grammars. Alexander Okhotin |
| 2003 | Branching Grammars: A Generalization of ET0L Systems. Frank Drewes, Joost Engelfriet |
| 2003 | Comments on Complete Sets of Tree Automata. Ferenc Gécseg |
| 2003 | Complexity Theory Made Easy. Heribert Vollmer |
| 2003 | Computation with Absolutely No Space Overhead. Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau |
| 2003 | Computing Languages by (Bounded) Local Sets. Dora Giammarresi |
| 2003 | Covering Problems from a Formal Language Point of View. Marcella Anselmo, Maria Madonia |
| 2003 | Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton. Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur |
| 2003 | Deleting String Rewriting Systems Preserve Regularity. Dieter Hofbauer, Johannes Waldmann |
| 2003 | Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings Zoltán Ésik, Zoltán Fülöp |
| 2003 | Distributed Pushdown Automata Systems: Computational Power. Erzsébet Csuhaj-Varjú, Victor Mitrana, György Vaszil |
| 2003 | Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. Markus Holzer, Martin Kutrib |
| 2003 | Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models. Diego de Falco, Massimiliano Goldwurm, Violetta Lonati |
| 2003 | From Glushkov WFAs to Rational Expressions. Pascal Caron, Marianne Flouret |
| 2003 | Generating Series of the Trace Group. Anne Bouillard, Jean Mairesse |
| 2003 | Learning a Regular Tree Language from a Teacher. Frank Drewes, Johanna Högberg |
| 2003 | Minimizing Finite Automata Is Computationally Hard. Andreas Malcher |
| 2003 | NFA Reduction Algorithms by Means of Regular Inequalities. Jean-Marc Champarnaud, Fabien Coulon |
| 2003 | On Deterministic Finite Automata and Syntactic Monoid Size, Continued. Markus Holzer, Barbara König |
| 2003 | On Enumeration of Müller Automata. Michael Domaratzki |
| 2003 | On Three Classes of Automata-Like P Systems. Rudolf Freund, Carlos Martín-Vide, Adam Obtulowicz, Gheorghe Paun |
| 2003 | On Well Quasi-orders on Languages. Flavio D'Alessandro, Stefano Varricchio |
| 2003 | On a Conjecture of Schnoebelen. Antonio Cano Gómez, Jean-Eric Pin |
| 2003 | Quantum Computing: 1-Way Quantum Automata. Alberto Bertoni, Carlo Mereghetti, Beatrice Palano |
| 2003 | Regular Languages Generated by Reflexive Finite Splicing Systems. Paola Bonizzoni, Clelia De Felice, Giancarlo Mauri, Rosalba Zizza |
| 2003 | Residual Finite Tree Automata. Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi |
| 2003 | Restarting Automata and Their Relations to the Chomsky Hierarchy. Friedrich Otto |
| 2003 | Synchronizing Monotonic Automata. Dimitry S. Ananichev, Mikhail V. Volkov |
| 2003 | Syntactic Semiring and Universal Automaton. Libor Polák |
| 2003 | Test Sets for Large Families of Languages. Wojciech Plandowski |
| 2003 | The Myhill-Nerode Theorem for Recognizable Tree Series. Björn Borchardt |
| 2003 | Tile Rewriting Grammars. Stefano Crespi-Reghizzi, Matteo Pradella |