List of accepted papers

	The papers will be published in Springer's LNCS proceedings (number 4664).

• John Fisher and Marc Bezem.
  Query Completeness of Skolem Machine Computations
• Jürgen Dassow and Bianca Truthe.
  On the Power of Networks of Evolutionary Processors
• Hidenosuke Nishio.
  Changing the Neighborhood of Cellular Automata
• Olivier Teytaud.
  Slightly beyond Turing's computability for studying genetic programming
• Artiom Alhazov, Rudolf Freund, Marion Oswald and Sergey Verlan.
  Partial Halting in P Systems Using Membrane Rules with Permitting Contexts
• Victor Mitrana, Juan Castellanos, Florin MANEA and Luis Fernando Mingo L\' opez.
  Accepting Networks of Splicing Processors With Filtered Connections
• Hermann Gruber, Markus Holzer and Martin Kutrib.
  More on the Size of Higman-Haines Sets: Effective Constructions
• Liesbeth De Mol.
  Study of Limits of Solvability in Tag Systems
• Turlough Neary and Damien Woods.
  Four small universal Turing machines
• Damien Woods and Turlough Neary.
  Small semi-weakly universal Turing machines
• Alexander Okhotin.
  A simple P-complete problem and its representations by language equations
• Tommaso Bolognesi.
  Planar trivalent network computation
• Jean-Baptiste Yunès.
  Simple New Algorithms which solve the Firing Squad Synchronization Problem: a 7-states 4n-steps solution
• Hiroshi Umeo.
  A Smallest Five-State Solution to the Firing Squad Synchronization Problem
• Artiom Matveevici, Yurii Rogozhin and Sergey Verlan.
  Insertion-Deletion Systems with One-Sided Context
• Dorothea Baumeister and Jörg Rothe.
  Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem
• Frantisek Mraz, Martin Platek and Friedrich Otto.
  Hierarchical relaxations of the correctness preserving property for restarting automata
• Artiom Alhazov and Mario de Jesús Pérez-Jiménez.
  Uniform Solution of QSAT using Polarizationless Active Membranes