libri scuola books Fumetti ebook dvd top ten sconti 0 Carrello


Torna Indietro
ARGOMENTO:  BOOKS > INFORMATICA > TESTI GENERALI

zenil hector (curatore) - cellular automata and discrete complex systems
Zoom

Cellular Automata and Discrete Complex Systems 26th IFIP WG 1.5 International Workshop, AUTOMATA 2020, Stockholm, Sweden, August 10–12, 2020, Proceedings




Disponibilità: Normalmente disponibile in 15 giorni


PREZZO
54,98 €
NICEPRICE
52,23 €
SCONTO
5%



Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.


Pagabile anche con Carta della cultura giovani e del merito, 18App Bonus Cultura e Carta del Docente


Facebook Twitter Aggiungi commento


Spese Gratis

Dettagli

Genere:Libro
Lingua: Inglese
Editore:

Springer

Pubblicazione: 10/2020
Edizione: 1st ed. 2020





Trama

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.





Sommario

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.











Altre Informazioni

ISBN:

9783030615871

Condizione: Nuovo
Collana: Lecture Notes in Computer Science
Dimensioni: 235 x 155 mm
Formato: Brossura
Illustration Notes:XXV, 153 p. 24 illus., 5 illus. in color.
Pagine Arabe: 153
Pagine Romane: xxv


Dicono di noi