1 option
Cellular Automata and Discrete Complex Systems : 24th IFIP WG 1.5 International Workshop, AUTOMATA 2018, Ghent, Belgium, June 20-22, 2018, Proceedings / edited by Jan M. Baetens, Martin Kutrib.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 10875.
- Theoretical Computer Science and General Issues ; 10875
- Language:
- English
- Subjects (All):
- Computers.
- Artificial intelligence.
- Logic, Symbolic and mathematical.
- Computer science--Mathematics.
- Computer science.
- Numerical analysis.
- Computation by Abstract Devices.
- Artificial Intelligence.
- Mathematical Logic and Formal Languages.
- Math Applications in Computer Science.
- Numeric Computing.
- Local Subjects:
- Computation by Abstract Devices.
- Artificial Intelligence.
- Mathematical Logic and Formal Languages.
- Math Applications in Computer Science.
- Numeric Computing.
- Physical Description:
- 1 online resource (IX, 143 pages) : 38 illustrations.
- Edition:
- First edition 2018.
- Contained In:
- Springer eBooks
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2018.
- System Details:
- text file PDF
- Summary:
- This volume constitutes the thoroughly refereed proceedings of the 24th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2018, held in Ghent, Belgium, in June 2018. The 10 regular papers presented in this book were carefully reviewed and selected from a total of 16 submissions. The papers highlight the major advances in the field and the development of new tools, support the development of theory and applications of CA and DCS and identify and study within an inter- and multidisciplinary context, the important fundamental aspects, concepts, notions and problems concerning CA and DCS. .
- Contents:
- A Gauge-Invariant Reversible Cellular Automaton
- Counter Machines and Distributed Automata
- Boolean Networks: Beyond Generalized Asynchronicity
- Evaluating the Quality of Local Structure Approximation Using Elementary Rule 14
- On Dynamical Complexity of Surjective Ultimately Right-Expansive Cellular Automata
- Sequentializing Cellular Automata
- Glider Automorphisms on Some Shifts of Finite Type and a Finitary Ryan's Theorem
- Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication
- Construction of Some Nonautomatic Sequences by Cellular Automata
- Any Shape can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-92675-9
- 9783319926759
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.