| 2002 | Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Sigma | Kostyantyn Archangelsky |
| 2002 | An Inverse Automata Algorithm for Recognizing 2-Collapsing Words. | Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov |
| 2002 | Tiling Systems over Infinite Pictures and Their Acceptance Conditions. | Jan-Henrik Altenbernd, Wolfgang Thomas, Stefan Whrle |
| 2002 | On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities. | Henry N. Adorna |
| 2001 | A Short Introduction to Infinite Automata. | Wolfgang Thomas |
| 2001 | The Entropy of Lukasiewicz-Languages. | Ludwig Staiger |
| 2001 | String Rewriting Sequential P-Systems and Regulated Rewriting. | Petr Sosk, Rudolf Freund |
| 2001 | Partially-Ordered Two-Way Automata: A New Characterization of DA. | Thomas Schwentick, Denis Thrien, Heribert Vollmer |
| 2001 | Eliminating Communication by Parallel Rewriting. | Branislav Rovan, Marin Slast'an |
| 2001 | Words and Patterns. | Antonio Restivo, Sergio Salemi |
| 2001 | Proof Complexity of Pigeonhole Principles. | Alexander A. Razborov |
| 2001 | Words, Permutations, and Representations of Numbers. | Helmut Prodinger |
| 2001 | Some Regular Languages That Are Church-Rosser Congruential. | Gundula Niemann, Johannes Waldmann |
| 2001 | The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages. | Gundula Niemann, Jens R. Woinowski |
| 2001 | Forbidden Factors and Fragment Assembly. | Filippo Mignosi, Antonio Restivo, Marinella Sciortino |
| 2001 | The Root of a Language and Its Complexity. | Gerhard Lischke |
| 2001 | Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable. | Dietrich Kuske |
| 2001 | A Universal Turing Machine with 3 States and 9 Symbols. | Manfred Kudlek, Yurii Rogozhin |
| 2001 | Some Petri Net Languages and Codes. | Masami Ito, Yoshiyuki Kunimochi |
| 2001 | On the Power of Randomized Pushdown Automata. | Juraj Hromkovic, Georg Schnitger |
| 2001 | Context-Free Valence Grammars - Revisited. | Hendrik Jan Hoogeboom |
| 2001 | Decision Questions on Integer Matrices. | Tero Harju |
| 2001 | An Undecidability Result Concerning Periodic Morphisms. | Vesa Halava, Tero Harju |
| 2001 | Level 5/2 of the Straubing-Thrien Hierarchy for Two-Letter Alphabets. | Christian Glaer, Heinz Schmitz |
| 2001 | Valuated and Valence Grammars: An Algebraic View. | Henning Fernau, Ralf Stiebe |