Abstract is missing.
- Automata Walking over Trees and GraphsHendrik Jan Hoogeboom. 11-14
- Streaming Tree Automata and XPathJoachim Niehren. 15-16
- Cellular Automata, Decidability and PhasespaceKlaus Sutner. 17-30
- Equivalence Relations of Mealy AutomataMiklós Bartha. 31-46
- Closure Operators Associated to Partially Ordered SetsLuca Bernardinello, Carlo Ferigato, Lucia Pomello, Stefania Rombolà. 47-60
- Events and Languages on Unary Quantum AutomataMaria Paola Bianchi, Beatrice Palano. 61-76
- Clearing Restarting AutomataPeter Cerno, Frantisek Mráz. 77-90
- Evolving Under Small DisruptionJürgen Dassow, Gema M. Martín, Francisco J. Vico. 91-106
- P Automata with Controlled Use of Minimal Communication RulesRudolf Freund, Marian Kogler, Sergey Verlan. 107-120
- One Pebble Versus log(n) BitsViliam Geffert, Carlo Mereghetti, Giovanni Pighizzini. 121-134
- An Automaton-based Formalism for Cooperative Augmented Reality SystemsFelix G. Hamza-Lup, Ferucio Laurentiu Tiplea. 135-150
- State Complexity of Intersection and Union of Suffix-Free Languages and Descriptional ComplexityGalina Jirásková, Pavol Olejár. 151-166
- 5' → 3' Watson-Crick Automata with Several RunsPeter Leupold, Benedek Nagy. 167-180
- Regulated Nondeterminism in PDAs: The Non-Regular CaseTomás Masopust. 181-194
- Automorphism Classification of Cellular AutomataHidenosuke Nishio. 195-208
- Model Syntax-Directed Translations by Tree TransducersCatalin Ionut Tîrnauca. 209-220
- Target Based Accepting Networks of Evolutionary Processors with Regular FiltersBianca Truthe. 221-236