Cellular Automata and Discrete Complex Systems

25th IFIP WG 1.5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings

Alonso Castillo-Ramirez, Pedro P. B. de Oliveira (Herausgeber)

Buch | Softcover

XVII, 105 Seiten

2019 | 1st ed. 2019
Springer International Publishing (Verlag)
978-3-030-20980-3 (ISBN)

Artikel merken

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.

Erscheinungsdatum	15.05.2019
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XVII, 105 p. 318 illus., 2 illus. in color.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	201 g
Themenwelt	Informatik ► Software Entwicklung ► User Interfaces (HCI)
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
Schlagworte	Automata Networks • Automata Theory • Boolean algebra • Boolean functions • boolean networks • Cellular Automata • Complexity theory • Computational Linguistics • context free languages • Databases • discrete complex systems • Finite Automata • Formal Languages • generating sets of monoids • iterative arrays • push-down automata • Sandpile models • symbolic dynamics • theorem proving
ISBN-10	3-030-20980-6 / 3030209806
ISBN-13	978-3-030-20980-3 / 9783030209803
Zustand	Neuware