EPTCS 1 - CSP 2008: Cork, Ireland

• Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler:
  Playing With Population Protocols. 3-15
  
• Cristian S. Calude:
  Simplicity via Provability for Universal Prefix-free Turing Machines. 16-21
  
• Matteo Cavaliere, Peter Leupold:
  Complexity through the Observation of Simple Systems. 22-30
  
• Matthew Cook:
  A Concrete View of Rule 110 Computation. 31-55
  
• Liesbeth De Mol:
  On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results. 56-66
  
• David Doty, Matthew J. Patitz, Scott M. Summers:
  Limitations of Self-Assembly at Temperature One (extended abstract). 67-69
  
• Jérôme Durand-Lose:
  Small Turing universal signal machines. 70-80
  
• Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier:
  Communications in cellular automata. 81-92
  
• Markus Holzer, Martin Kutrib, Andreas Malcher:
  Multi-Head Finite Automata: Characterizations, Concepts and Open Problems. 93-107
  
• Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
  Computational Power of P Systems with Small Size Insertion and Deletion Rules. 108-117
  
• Manfred Kudlek:
  Some Considerations on Universality. 118-122
  
• Grégory Lafitte:
  Busy beavers gone wild. 123-129
  
• Fred Lunnon:
  The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings. 130-148
  
• Jack H. Lutz:
  A Divergence Formula for Randomness and Dimension (Short Version). 149-152
  
• Maurice Margenstern:
  On the injectivity of the global function of a cellular automaton in the hyperbolic plane (extended abstract). 153-163
  
• Philippe Moser:
  A General Notion of Useful Information. 164-171
  
• Niall Murphy, Damien Woods:
  On acceptance conditions for membrane systems: characterisations of L and NL. 172-184
  
• Alexander Okhotin:
  Representing a P-complete problem by small trellis automata. 185-198
  
• Nicolas Ollinger:
  Intrinsically Universal Cellular Automata. 199-204
  
• Nicolas Ollinger, Gaétan Richard:
  A Particular Universal Cellular Automaton. 205-214
  
• Matthew J. Patitz, Scott M. Summers:
  Self-Assembly of Infinite Structures. 215-225
  
• Klaus Sutner:
  Computational Processes and Incompleteness. 226-234
  
• Sergey Verlan, Yurii Rogozhin:
  New Choice for Small Universal Devices: Symport/Antiport P Systems. 235-241