Abstract is missing.
- Subregular Restrictions for Some Language Generating DevicesJürgen Dassow. 11-26
- Recent Results Around the Sakoda and Sipser QuestionGiovanni Pighizzini. 27-32
- Formal Power Series and the Invertibility of Finite Linear TransducersIvone Amorim, António Machiavelo, Rogério Reis. 33-48
- Cellular Automata Get Their Wires CrossedEd Blakey. 49-64
- Extended Splicing Systems with Subregular Sets of Splicing RulesJürgen Dassow, Bianca Truthe. 65-78
- Language Operators for Multiset Languages and Modal LogicNils Erik Flick, Manfred Kudlek. 79-91
- Transducing by Observing and Restarting TransducersNorbert Hundeshagen, Peter Leupold. 93-106
- Bidirectional String Assembling SystemsMartin Kutrib, Matthias Wendlandt. 107-121
- Computing by Observing Change in Insertion/Deletion SystemsPeter Leupold. 123-132
- Revisiting Waiting Times in DNA EvolutionPierre Nicodème. 133-148
- On the Computational Power of Reaction Automata Working in Sequential MannerFumiya Okubo. 149-163
- Limited Context Restarting Automata and McNaughton Families of LanguagesFriedrich Otto, Peter Cerno, Frantisek Mráz. 165-180
- Taxonomy of Red-Automata Motivated by Error LocalizationMartin Procházka, Martin Plátek. 181-195
- Systems of Parallel Communicating Restarting AutomataMarcel Vollweiler, Friedrich Otto. 197-212
- The Lattice of Automata Classes: on ?Mild? Extensions of Pushdown AutomataChristian Wurm. 213-228