Invited Papers

• 
  Hendrik Jan Hoogeboom: Automata Walking over Trees and Graphs. 11-14
• 
  Joachim Niehren: Streaming Tree Automata and XPath. 15-16
• 
  Klaus Sutner: Cellular Automata, Decidability and Phasespace. 17-30

Regular Contributions

• 
  Miklós Bartha: Equivalence Relations of Mealy Automata. 31-46
• 
  Luca Bernardinello, Carlo Ferigato, Lucia Pomello, Stefania Rombolà: Closure Operators Associated to Partially Ordered Sets. 47-60
• 
  Maria Paola Bianchi, Beatrice Palano: Events and Languages on Unary Quantum Automata. 61-76
• 
  Peter Cerno, Frantisek Mráz: Clearing Restarting Automata. 77-90
• 
  Jürgen Dassow, Gema M. Martín, Francisco J. Vico: Evolving Under Small Disruption. 91-106
• 
  Rudolf Freund, Marian Kogler, Sergey Verlan: P Automata with Controlled Use of Minimal Communication Rules. 107-120
• 
  Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini: One Pebble Versus log(n) Bits. 121-134
• 
  Felix G. Hamza-Lup, Ferucio Laurentiu Tiplea: An Automaton-based Formalism for Cooperative Augmented Reality Systems. 135-150
• 
  Galina Jirásková, Pavol Olejár: State Complexity of Intersection and Union of Suffix-Free Languages and Descriptional Complexity. 151-166
• 
  Peter Leupold, Benedek Nagy: 5' → 3' Watson-Crick Automata with Several Runs. 167-180
• 
  Tomás Masopust: Regulated Nondeterminism in PDAs: The Non-Regular Case. 181-194
• 
  Hidenosuke Nishio: Automorphism Classification of Cellular Automata. 195-208
• 
  Catalin Ionut Tîrnauca: Model Syntax-Directed Translations by Tree Transducers. 209-220
• 
  Bianca Truthe: Target Based Accepting Networks of Evolutionary Processors with Regular Filters. 221-236

last updated on Tue May 21 02:20:57 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page