• Marcella Anselmo, Dora Giammarresi and Maria Madonia. Regular expressions for two-dimensional languages over one-letter alphabet
• Bernd Borchert, Frank Stephan, Klaus-Joern Lange, Pascal Tesson and Denis Therien. The dot-depth and polynomial hierarchy correspond on the \Delta levels
• Henning Bordihn, Markus Holzer, Martin Kutrib. Input reversals and iterated pushdown automata--a new characterization
• Christian Choffrut, Massimiliano Goldwurm and Violetta Lonati. On the maximum coefficients of rational formal series in commuting variables
• Flavio D'Alessandro and Stefano Varricchio. Avoidable sets and well quasi orders
• Mark Daley, Michael Domaratzki. On codes defined by bio-operations
• Jurgen Dassow. A ciliate bio-operation and language families
• Michael Domaratzki. Semantic shuffle and deletion along trajectories
• Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit, Ilaria Venturini. Sturmian graphs and a conjecture of Moser
• Rudolf Freund. Asynchronous P Systems on arrays and strings
• Jozef Gruska, Salvatore La Torre, Mimmo Parente. Optimal time and communication solutions of FSSP on square arrays, toruses and rings
• Oscar Ibarra, Hsu-Chun Yen, Zhe Dang. The power of maximal parallelism in P systems
• Shunsuke Inenaga, Ayumi Shinohara and Masayuki Takeda. An efficient pattern matching algorithm on a subclass of context free grammar
• Tomasz Jurdzinski, Friedrich Otto, Frantizek Mraz and Martin Platek. On the complexity of 2-monotone restarting automata
• Tomasz Jurdzinski, Friedrich Otto, Frantizek Mraz and Martin Platek. On left-monotone deterministic restarting automata
• Oleksiy Kurganskyy, Igor Potapov. On the computation power of finite automata in two dimensional
• Dietrich Kuske and Peter Weigel. The role of the complementarity relation in Watson-Crick automata and sticker systems
• Martin Kutrib, Andreas Malcher and Detlef Wotschke. The Boolean closure of linear context-free languages
• Stephen R. Lakin and Richard M. Thomas. Context-sensitive decision problems in groups
• Markus Lohrey. Decidability and complexity in automatic monoids
• Andreas Maletti. Relating tree series transducers and weighted tree automata
• Anca Muscholl, Igor Walukiewicz. An NP-complete fragment of LTL
• Igor Potapov. From Post systems to the reachability problems for matrix semigroups and counter automata
• Narad Rampersad. Words avoiding $\frac{7}{3}$-powers and the Thue--Morse morphism
• Daniel Reidenbach. On the equivalence problem for E-pattern languages over small alphabets
• Chloa Rispal and Olivier Carto. Complementation of rational sets on countable scattered linear orderings.
• Ludwig Staiger. On the Hausdorff measure of Omega-power languages
• Maurice ter Beek, Erzsebet Csuhaj-Varju, Markus Holzer, Gyorgy Vaszil. On competence in CD grammar systems
• Bianca Truthe. A method for deciding the finiteness of deterministic tabled picture languages
• Sergey Verlan. Tissue P systems with minimal symport/antiport