Cantitate/Preț
Produs
Total produse
Vezi coșul
Cellular Automata and Discrete Complex Systems: 24th IFIP WG 1.5 International Workshop, AUTOMATA 2018, Ghent, Belgium, June 20–22, 2018, Proceedings de Jan M. Baetens

Cellular Automata and Discrete Complex Systems: 24th IFIP WG 1.5 International Workshop, AUTOMATA 2018, Ghent, Belgium, June 20–22, 2018, Proceedings: Lecture Notes in Computer Science, cartea 10875

Editat de Jan M. Baetens, Martin Kutrib
en Limba Engleză Paperback – 25 mai 2018
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. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31893 lei

Preț vechi: 39866 lei
-20% Nou

Puncte Express: 478
Preț estimativ în valută:
6104€ • 6404$ • 5064£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319926742
ISBN-10: 3319926748
Pagini: 144
Ilustrații: IX, 143 p. 38 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.23 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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.