Cellular Automata and Discrete Complex Systems, 1st ed. 2019 25th IFIP WG 1.5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26-28, 2019, Proceedings Theoretical Computer Science and General Issues Series
Langue : Anglais
Coordonnateurs : Castillo-Ramirez Alonso, de Oliveira Pedro P. B.
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.
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.
Date de parution : 05-2019
Ouvrage de 105 p.
15.5x23.5 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 52,74 €
Ajouter au panierThèmes de Cellular Automata and Discrete Complex Systems :
Mots-clés :
cellular automata; discrete complex systems; complexity theory; automata networks; iterative arrays; generating sets of monoids; automata theory; formal languages; sandpile models; symbolic dynamics; boolean algebra; boolean functions; boolean networks; computational linguistics; context free languages; databases; finite automata; push-down automata; theorem proving
© 2024 LAVOISIER S.A.S.
