Cellular Automata and Discrete Complex Systems 25th IFIP WG 1. 5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26-28, 2019, Proceedings

• Main Authors: Castillo-Ramirez, Alonso, de Oliveira, Pedro P. B
• Format: eBook
• Language: English
• Published: Cham Springer International Publishing AG 2019
• Edition: 1
• Subjects: Cellular automata

Table of Contents:

• Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Quantum Cellular Automata: Computability and Universality -- Algorithmic Information Dynamics Reconstructs the Space-Time and Phase-Space Dynamics of Cellular Automata -- The Garden of Eden Theorem: From Cellular Automata to Algebraic Dynamical Systems -- Contents -- On the Effects of Firing Memory in the Dynamics of Conjunctive Networks -- 1 Introduction -- 2 Contributions and Structure of the Paper -- 3 Preliminaries -- 3.1 Previous Results -- 4 Conjunctive Networks with Firing Memory Admit Non-polynomial Cycles -- 5 2-And-Prediction is PSPACE-complete. -- 6 Discussion -- References -- Complexity-Theoretic Aspects of Expanding Cellular Automata -- 1 Introduction -- 2 Basic Definitions -- 2.1 Formal Languages and Turing Machines -- 2.2 Cellular Automata -- 3 Characterizing the XCA Polynomial-Time Class -- 3.1 A First Characterization -- 4 Immediate Implications -- 4.1 XCAs with Multiple Accept and Reject States -- 4.2 Existential XCA -- 4.3 One-Cell-Decision XCA -- 5 Conclusion -- References -- Iterative Arrays with Finite Inter-cell Communication -- 1 Introduction -- 2 Definitions and Preliminaries -- 3 k+1 Communications Are Better than k -- 4 Undecidability Results for Realtime MC(const)-IAs -- References -- Bounding the Minimal Number of Generators of Groups and Monoids of Cellular Automata -- 1 Introduction -- 2 Basic Results -- 3 Upper Bounds for Ranks -- 3.1 Dihedral Groups -- 3.2 Other Finite Groups -- 4 Lower Bounds on Ranks -- 4.1 Finite Groups -- 4.2 Infinite Groups -- References -- Enhancement of Automata with Jumping Modes -- 1 Introduction -- 2 Modes of Tape Head Move -- 2.1 Tape Head Modes -- 2.2 Language Classes -- 2.3 Differences of Modes of Tape Head Move -- 3 One-Way Jumping Nondeterministic Finite Automata (NFA)
• 4 One-Way Jumping Pushdown Automaton: ()-NPDA, ()-DPDA -- 5 Summary -- References -- Iterative Arrays with Self-verifying Communication Cell -- 1 Introduction -- 2 Preliminaries and Definitions -- 3 Structural Properties and Speed-Up -- 4 Computational Capacity -- 5 Closure Properties -- 6 Decidability Questions -- References -- Generic Properties in Some Classes of Automaton Groups -- 1 Introduction -- 2 Automaton Groups -- 2.1 Mealy Automata and Automaton (Semi)Groups -- 2.2 Classes of Mealy Automata -- 3 Reversible Mealy Automata -- 4 Reset Mealy Automata -- 5 Mealy Automata with Polynomial Activity -- 6 Conclusion and Future Work -- References -- Author Index