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.
AUTOMATA (Workshop) (24th : 2018 : Ghent, Belgium); Baetens, Jan M. editor.; Kutrib, Martin, editor.
2018
QA267.5.C45
Available Online

Linked e-resources

Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks

Details

Title
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.
Meeting Name
AUTOMATA (Workshop) (24th : 2018 : Ghent, Belgium)
ISBN
9783319926759 (electronic book)
3319926756 (electronic book)
9783319926742
DOI
https://doi.org/10.1007/978-3-319-92675-9
Published
Cham : : Springer, 2018.
Language
English
Description
1 online resource (ix, 143 pages) : illustrations.
Item Number
10.1007/978-3-319-92675-9 doi
Call Number
QA267.5.C45
Dewey Decimal Classification
004.0151
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. .
Access Note
Access limited to authorized users.
Digital File Characteristics
text file PDF
Added Author
Baetens, Jan M. editor.
Kutrib, Martin, editor.
Series
Lecture notes in computer science ; 10875.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
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.

Browse Subjects

Show more subjects...

Statistics

from
to
Export