Linked e-resources
Details
Table of Contents
Intro; Preface; References; Contents; A Snapshot of My Life; FSSP Algorithms for 2D Rectangular Arrays. Recent Developments; 1 Introduction; 2 Firing Squad Synchronization Problem; 2.1 FSSP on 2D Cellular Arrays; 2.2 Lower-Bound and Optimality in 2D FSSP Algorithms; 3 Beyer-Shinahr Algorithm; 4 Umeo-Kubo-Nomura Zebra Implementations; 5 Umeo-Yunès-Yamawaki Algorithm; 5.1 Freezing-Thawing Technique for Delayed FSSP; 5.2 Algorithm mathcalA3; 6 Umeo-Yamawaki-Nishide Algorithm; 6.1 Algorithm mathcalA4; 6.2 Synchronization; 6.3 Construction of the Algorithm mathcalA4; 7 Summary; References
Abelian Invertible Automata1 Motivation; 2 Transducers and Automorphisms of the Binary Tree; 3 Abelian Automata; 3.1 Canonical and Principal Automata; 3.2 Self-affine Tiles; 4 Path Polynomials; 5 Knuth Normal Form; 6 Open Problems; References; Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage; 1 Introduction; 2 Definitions; 2.1 Cellular Automata; 2.2 Block Cellular Automata; 2.3 Partitioned Cellular Automata; 2.4 Reversibility; 2.5 Simulation and Intrinsic Universality; 3 Simulations Between Classes of CA
3.1 Simulation of BCA by CA (and R-BCA by R-CA)3.2 Simulation of CA by PCA; 3.3 Simulation of CA by BCA; 3.4 Simulation of R-CA by R-BCA; 3.5 Simulation of R-BCA (and R-CA) by R-PCA; 4 Intrinsic Universality of 1-R-PCA; 4.1 Macroscopic Level; 4.2 States, Layers and Configurations at Microscopic Level; 4.3 Microscopic Algorithm; 4.4 Local Function of mathcalU; 4.5 Simulation; 5 Space-Time Simulation of Irreversible CA by Reversible Ones; 5.1 Space-Time Approach; 5.2 Macro Dynamics; 5.3 Micro Dynamics; 5.4 State Function; 5.5 Generalization Sketch; 6 Conclusion; References
A Weakly Universal Cellular Automaton on the Grid {8, 3} with Two States1 Introduction; 2 The Scenario of the Simulation; 2.1 The Tracks; 2.2 The Structures of the Simulation; 2.3 The Controller and the Controller-Sensor; 3 Rules; 3.1 The Rules for the Tracks; 3.2 The Rules for the Fixed Switch; 3.3 The Rules for the Doubler and for the Fork; 3.4 The Rules for the Selector; 3.5 The Rules for the Controller; 3.6 The Rules for the Sensor; 4 Conclusion; References; Cellular Automata: Descriptional Complexity and Decidability; 1 Introduction; 2 Definitions and Preliminaries
2.1 Cellular Automata and Iterative Arrays2.2 Descriptional Complexity; 3 Non-Recursive Trade-Offs; 4 Resource-Bounded Models; 4.1 Multi-Dimensional Iterative Arrays; 4.2 Communication-Bounded Iterative Arrays; 4.3 Space-Bounded Iterative Arrays; 4.4 Time-Bounded Iterative Arrays; 4.5 Iterative Arrays with Set Storage; 5 Recursive Trade-Offs; 6 State Complexity; 6.1 State Complexity of Realtime-OCA; 6.2 State Complexity of kC-OCA; 6.3 Decomposition Problems; References; Invertible Construction of Decimal-to-Binary Converter Using Reversible Elements; 1 Introduction; 2 Preliminaries
Abelian Invertible Automata1 Motivation; 2 Transducers and Automorphisms of the Binary Tree; 3 Abelian Automata; 3.1 Canonical and Principal Automata; 3.2 Self-affine Tiles; 4 Path Polynomials; 5 Knuth Normal Form; 6 Open Problems; References; Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage; 1 Introduction; 2 Definitions; 2.1 Cellular Automata; 2.2 Block Cellular Automata; 2.3 Partitioned Cellular Automata; 2.4 Reversibility; 2.5 Simulation and Intrinsic Universality; 3 Simulations Between Classes of CA
3.1 Simulation of BCA by CA (and R-BCA by R-CA)3.2 Simulation of CA by PCA; 3.3 Simulation of CA by BCA; 3.4 Simulation of R-CA by R-BCA; 3.5 Simulation of R-BCA (and R-CA) by R-PCA; 4 Intrinsic Universality of 1-R-PCA; 4.1 Macroscopic Level; 4.2 States, Layers and Configurations at Microscopic Level; 4.3 Microscopic Algorithm; 4.4 Local Function of mathcalU; 4.5 Simulation; 5 Space-Time Simulation of Irreversible CA by Reversible Ones; 5.1 Space-Time Approach; 5.2 Macro Dynamics; 5.3 Micro Dynamics; 5.4 State Function; 5.5 Generalization Sketch; 6 Conclusion; References
A Weakly Universal Cellular Automaton on the Grid {8, 3} with Two States1 Introduction; 2 The Scenario of the Simulation; 2.1 The Tracks; 2.2 The Structures of the Simulation; 2.3 The Controller and the Controller-Sensor; 3 Rules; 3.1 The Rules for the Tracks; 3.2 The Rules for the Fixed Switch; 3.3 The Rules for the Doubler and for the Fork; 3.4 The Rules for the Selector; 3.5 The Rules for the Controller; 3.6 The Rules for the Sensor; 4 Conclusion; References; Cellular Automata: Descriptional Complexity and Decidability; 1 Introduction; 2 Definitions and Preliminaries
2.1 Cellular Automata and Iterative Arrays2.2 Descriptional Complexity; 3 Non-Recursive Trade-Offs; 4 Resource-Bounded Models; 4.1 Multi-Dimensional Iterative Arrays; 4.2 Communication-Bounded Iterative Arrays; 4.3 Space-Bounded Iterative Arrays; 4.4 Time-Bounded Iterative Arrays; 4.5 Iterative Arrays with Set Storage; 5 Recursive Trade-Offs; 6 State Complexity; 6.1 State Complexity of Realtime-OCA; 6.2 State Complexity of kC-OCA; 6.3 Decomposition Problems; References; Invertible Construction of Decimal-to-Binary Converter Using Reversible Elements; 1 Introduction; 2 Preliminaries