Cantitate/Preț
Produs
Total produse
Vezi coșul
Cellular Automata and Discrete Complex Systems: 25th IFIP WG 1.5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings de Alonso Castillo-Ramirez

Cellular Automata and Discrete Complex Systems: 25th IFIP WG 1.5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings: Lecture Notes in Computer Science, cartea 11525

Editat de Alonso Castillo-Ramirez, Pedro P. B. de Oliveira
en Limba Engleză Paperback – 14 mai 2019
This volume constitutes the refereed proceedings of the 25th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2019, held in Guadalajara, Mexico, in June 2019.
The 7 regular papers presented in this book were carefully reviewed and selected from a total of 10 submissions. The topics of the conference include deal with 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, scientic modeling, and practical applications.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31747 lei

Preț vechi: 39684 lei
-20% Nou

Puncte Express: 476
Preț estimativ în valută:
6076€ • 6311$ • 5047£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783030209803
ISBN-10: 3030209806
Pagini: 99
Ilustrații: XVII, 105 p. 318 illus., 2 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.19 kg
Ediția:1st ed. 2019
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

On the Effects Offering Memory in the Dynamics of Conjunctive Networks.- Complexity-Theoretic Aspects of Expanding Cellular Automata.- Iterative Arrays with Finite Inter-Cell Communication.- Bounding the Minimal Number of Generators of Groups and Monoids of Cellular Automata.- Enhancement of Automata with Jumping Modes.- Iterative Arrays with Self-Verifying Communication Cell.- Generic Properties in Some Classes of Automation Groups.