Cantitate/Preț
Produs

Cellular Automata and Discrete Complex Systems: 26th IFIP WG 1.5 International Workshop, AUTOMATA 2020, Stockholm, Sweden, August 10–12, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12286

Editat de Hector Zenil
en Limba Engleză Paperback – 18 oct 2020
This volume constitutes the refereed post-conference proceedings of the 26th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2020, held in Stockholm, Sweden, in August 2020. The workshop was held virtually. The 11 full papers presented in this book were carefully reviewed and selected from a total of 21 submissions. The topics of the conference include dynamical, topological, ergodic and algebraic aspects of CA and DCS, algorithmic and complexity issues, emergent properties, formal languages, symbolic dynamics, tilings, models of parallelism and distributed systems, timing schemes, synchronous versus asynchronous models, phenomenological descriptions, scientific modeling, and practical applications.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32040 lei

Preț vechi: 40049 lei
-20% Nou

Puncte Express: 481

Preț estimativ în valută:
6132 6374$ 5080£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030615871
ISBN-10: 3030615871
Pagini: 153
Ilustrații: XXV, 153 p. 24 illus., 5 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.27 kg
Ediția:1st ed. 2020
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

Exploring Millions of 6-State FSSP Solutions: the Formal Notion of Local CA Simulation.- Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures.- Cycle based Clustering using Reversible Cellular Automata.- Commutative automata networks.- Cellular String Generators.- Everywhere Zero Pointwise Lyapunov Exponents for Sensitive Cellular Automata.- Self-Stabilizing Distributed Algorithms by Gellular Automata.- A characterization of amenable groups with Besicovitch pseudodistances.- Four heads are better than three.- Complexity of Generic Limit Sets of Cellular Automata.- Latin Hypercubes and Cellular Automata.