Mathematics / DMTCS Proceedings, "Freezing, Bounded-Change and Convergent Cellular Automata."
The Free Library,
1 Introduction and Formal Setting Cellular automata (CA for short) are a well-studied model appearing in different research…
Cellular Automata and Discrete Complex Systems
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Strict Asymptotic Nilpotency in Cellular Automata
-
Altmetric BadgeChapter 2 Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties
-
Altmetric BadgeChapter 3 Restricted Binary Strings and Generalized Fibonacci Numbers
-
Altmetric BadgeChapter 4 Von Neumann Regular Cellular Automata
-
Altmetric BadgeChapter 5 Enumerative Results on the Schröder Pattern Poset
-
Altmetric BadgeChapter 6 Canonical Form of Gray Codes in N-cubes
-
Altmetric BadgeChapter 7 Equicontinuity and Sensitivity of Nondeterministic Cellular Automata
-
Altmetric BadgeChapter 8 Diploid Cellular Automata: First Experiments on the Random Mixtures of Two Elementary Rules
-
Altmetric BadgeChapter 9 On the Computational Complexity of the Freezing Non-strict Majority Automata
-
Altmetric BadgeChapter 10 Distortion in One-Head Machines and Cellular Automata
-
Altmetric BadgeChapter 11 Fast One-Way Cellular Automata with Reversible Mealy Cells
-
Altmetric BadgeChapter 12 Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata
-
Altmetric BadgeChapter 13 Filling Curves Constructed in Cellular Automata with Aperiodic Tiling
-
Altmetric BadgeChapter 14 Some Computational Limits of Trellis Automata
-
Altmetric BadgeChapter 15 Turing-Completeness of Asynchronous Non-camouflage Cellular Automata
Attention for Chapter 9:
On the Computational Complexity of the Freezing Non-strict Majority Automata