On the complexity of asynchronous freezing cellular automata
From MaRDI portal
Publication:2051787
Recommendations
- Computational complexity of finite asynchronous cellular automata
- Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
- ON ASYNCHRONOUS CELLULAR AUTOMATA
- Fundamentals of Computation Theory
- Computational aspects of asynchronous cellular automata
- Asynchronous cellular automata and dynamical properties
- On the complexity of the stability problem of binary freezing totalistic cellular automata
- Some Formal Properties of Asynchronous Cellular Automata
- Delay-insensitive computation in asynchronous cellular automata
- Turing-completeness of asynchronous non-camouflage cellular automata
Cites work
- A parallel cellular automata environment on multicomputers for computational science
- Actin Automata: Phenomenology and Localizations
- Algebraic properties of cellular automata
- An experimental study of robustness to asynchronism for elementary cellular automata
- An introduction to tile-based self-assembly and a survey of recent results
- Bulking I: An abstract theory of bulking
- Bulking II: Classifications of cellular automata
- Cell space approaches in biomathematics
- Combinatorial optimization problems in self-assembly
- Complexity of Self‐Assembled Shapes
- Computation theory of cellular automata
- Computational Complexity
- Computational complexity of dynamical systems: the case of cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Fully asynchronous behavior of double-quiescent elementary cellular automata
- scientific article; zbMATH DE number 3896307 (Why is no real title available?)
- scientific article; zbMATH DE number 3761989 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 3555903 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- Model checking one-dimensional cellular automata
- On the complexity of the stability problem of binary freezing totalistic cellular automata
- P-completeness of Cellular Automaton Rule 110
- Reversibility and surjectivity problems of cellular automata
- Simulating complex systems by cellular automata.
- Statistical mechanics of cellular automata
- Strict self-assembly of discrete Sierpinski triangles
- The complexity of the asynchronous prediction of the majority automata
- The complexity of the bootstraping percolation and other problems
- The complexity of theorem-proving procedures
- The program-size complexity of self-assembled squares (extended abstract)
Cited in
(9)- Universality in freezing cellular automata
- On the computational complexity of the freezing non-strict majority automata
- On the impact of treewidth in the computational complexity of freezing dynamics
- On the complexity of the stability problem of binary freezing totalistic cellular automata
- m-asynchronous cellular automata: from fairness to quasi-fairness
- Fundamentals of Computation Theory
- Freezing, bounded-change and convergent cellular automata
- Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
- Agent motion planning as block asynchronous cellular automata: pushing, pulling, suplexing, and more
This page was built for publication: On the complexity of asynchronous freezing cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051787)
