Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9664)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: AUTOMATA 2016.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
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.
Similar content being viewed by others
Keywords
- 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
Table of contents (15 papers)
-
Front Matter
-
Regular Papers
-
Front Matter
-
-
Back Matter
Other volumes
-
Cellular Automata and Discrete Complex Systems
Editors and Affiliations
Bibliographic Information
Book Title: Cellular Automata and Discrete Complex Systems
Book Subtitle: 22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15-17, 2016, Proceedings
Editors: Matthew Cook, Turlough Neary
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-39300-1
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: IFIP International Federation for Information Processing 2016
Softcover ISBN: 978-3-319-39299-8Published: 27 June 2016
eBook ISBN: 978-3-319-39300-1Published: 01 June 2016
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XVI, 199
Number of Illustrations: 77 b/w illustrations
Topics: Computation by Abstract Devices, Algorithm Analysis and Problem Complexity, Simulation and Modeling, Computer Communication Networks, Discrete Mathematics in Computer Science, Mathematical Logic and Formal Languages