Cellular Automata and Discrete Complex Systems

22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15-17, 2016, Proceedings

  • Matthew Cook
  • Turlough Neary

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9664)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9664)

Table of contents

  1. Front Matter
    Pages I-XVI
  2. Invited Papers

    1. Front Matter
      Pages 1-1
    2. Tommaso Toffoli
      Pages 10-25
  3. Regular Papers

    1. Front Matter
      Pages 33-33
    2. Shigeki Akiyama, Katsunobu Imai
      Pages 35-48
    3. Sebastián Barbieri, Jarkko Kari, Ville Salo
      Pages 49-62
    4. Silvio Capobianco, Jarkko Kari, Siamak Taati
      Pages 77-89
    5. Alonso Castillo-Ramirez, Maximilien Gadouleau
      Pages 90-104
    6. E. N. M. Cirillo, F. R. Nardi, C. Spitoni
      Pages 105-119
    7. Ronaldo de Castro Corrêa, Pedro P. B. de Oliveira
      Pages 120-134
    8. Nazim Fatès, Irène Marcovici, Siamak Taati
      Pages 135-148
    9. Augusto Modanese, Thomas Worsch
      Pages 159-169
  4. Back Matter
    Pages 199-199

About these proceedings


This volume constitutes the thoroughly refereed proceedings of the 22nd IFIP WG 1.5
International Workshop on Cellular Automata and Discrete Complex
Systems, AUTOMATA 2016, held in Zurich, Switzerland, in June 2016.

This volume contains 3 invited talks in full-paper length and 12 regular
papers, which were carefully reviewed and selected from a total of 23
submissions. The papers feature research on all fundamental aspects of cellular automata and related discrete complex systems and deal with the following topics: dynamical, topological, ergodic and algebraic aspects; algorithmic and complexity issues; emergent properties; formal language processing; symbolic dynamics; models of parallelism and distributed systems; timing schemes; phenomenological descriptions; scientific modeling; and practical applications.


computational complexity discrete dynamical system reversibility Turing machine universality abstract geometrical computation cellular automata cellular automata groups computability density classification problem dynamical system formal languages garden of eden configuration interacting particle systems probabilistic cellular automata reachability reversible cellular automata signal machines tilings unconventional models of computation

Editors and affiliations

  • Matthew Cook
    • 1
  • Turlough Neary
    • 2
  1. 1.University of ZurichZürichSwitzerland
  2. 2.University of ZurichZurichSwitzerland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-39300-1
  • Copyright Information IFIP International Federation for Information Processing 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-39299-8
  • Online ISBN 978-3-319-39300-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book