Electronic Notes in Theoretical Computer Science, Volume 251

Volume 251, September 2009

• Milan Ceska, Zdenek Kotásek, Mojmír Kretínský, Ludek Matyska, Tomás Vojnar:
  Preface. 1-3
  
• Václav Brozek:
  Regularity in PDA Games Revisited. 5-16
  
• Ivan Fialík:
  Noise and the Mermin-GHZ Game. 17-26
  
• Parosh Aziz Abdulla, Lukás Holík, Lisa Kaati, Tomás Vojnar:
  A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. 27-48
  
• Morten Kühnrich:
  Formal Model-Driven Design of Distributed Algorithms. 49-64
  
• Joachim Kneis, Alexander Langer:
  A Practical Approach to Courcelle's Theorem. 65-81
  
• Florian Lonsing, Armin Biere:
  Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers. 83-95