| 2008 | Relationally Periodic Sequences and Subword Complexity. | Julien Cassaigne, Tomi Krki, Luca Q. Zamboni |
| 2008 | The Synchronization Problem for Strongly Transitive Automata. | Arturo Carpi, Flavio D'Alessandro |
| 2008 | Algorithmically Independent Sequences. | Cristian S. Calude, Marius Zimand |
| 2008 | Universal Recursively Enumerable Sets of Strings. | Cristian S. Calude, Andr Nies, Ludwig Staiger, Frank Stephan |
| 2008 | On a Generalization of Standard Episturmian Morphisms. | Michelangelo Bucci, Aldo de Luca, Alessandro De Luca |
| 2008 | On the Computational Capacity of Parallel Communicating Finite Automata. | Henning Bordihn, Martin Kutrib, Andreas Malcher |
| 2008 | The Average State Complexity of the Star of a Finite Set of Words Is Linear. | Frdrique Bassino, Laura Giambruno, Cyril Nicaud |
| 2008 | Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. | Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl |
| 2008 | General Algorithms for Testing the Ambiguity of Finite Automata. | Cyril Allauzen, Mehryar Mohri, Ashish Rastogi |
| 2008 | On the Non-deterministic Communication Complexity of Regular Languages. | Anil Ada |
| 2007 | On Transition Minimality of Bideterministic Automata. | Hellis Tamm |
| 2007 | Fine Hierarchy of Regular Aperiodic | Victor L. Selivanov |
| 2007 | Suffix Automata and Standard Sturmian Words. | Marinella Sciortino, Luca Q. Zamboni |
| 2007 | Descriptional Complexity of Nondeterministic Finite Automata. | Kai Salomaa |
| 2007 | Finite Automata and the Writing of Numbers. | Jacques Sakarovitch |
| 2007 | A Local Balance Property of Episturmian Words. | Gwnal Richomme |
| 2007 | On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases. | Yuri Pritykin |
| 2007 | Finite Automata on Unranked and Unordered DAGs. | Lutz Priese |
| 2007 | A Star Operation for Star-Free Trace Languages. | Edward Ochmanski, Krystyna Stawikowska |
| 2007 | Definable Transductions and Weighted Logics for Texts. | Christian Mathissen |
| 2007 | Descriptional Complexity of Bounded Context-Free Languages. | Andreas Malcher, Giovanni Pighizzini |
| 2007 | Complexity Theory for Splicing Systems. | Remco Loos, Mitsunori Ogihara |
| 2007 | Information Distance and Applications. | Ming Li |
| 2007 | Duplication Roots. | Peter Leupold |
| 2007 | What Do We Know About Language Equations? | Michal Kunc |