An atlas of limit set dynamics for asynchronous elementary cellular automata
From MaRDI portal
(Redirected from Publication:393149)
Recommendations
- Asynchronous cellular automata and dynamical properties
- Limit properties of doubly quiescent \(m\)-asynchronous elementary cellular automata
- On the Limit Sets of Cellular Automata
- Limit sets of stable and unstable cellular automata
- Limit sets of stable cellular automata
- Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates
- Some Formal Properties of Asynchronous Cellular Automata
- Dynamics groups of asynchronous cellular automata
Cites work
- scientific article; zbMATH DE number 4042465 (Why is no real title available?)
- scientific article; zbMATH DE number 45557 (Why is no real title available?)
- Acyclic orientations of random graphs
- An introduction to sequential dynamical systems
- Conjugacy relation on Coxeter elements
- Cycle equivalence of graph dynamical systems
- Discrete, sequential dynamical systems
- Dynamics groups of asynchronous cellular automata
- On enumeration of conjugacy classes of Coxeter elements
- On reorienting graphs by pushing down maximal vertices
- On the computational complexity of the Jones and Tutte polynomials
- Order Independence in Asynchronous Cellular Automata
- Posets from admissible Coxeter sequences.
- Update sequence stability in graph dynamical systems
Cited in
(5)
This page was built for publication: An atlas of limit set dynamics for asynchronous elementary cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393149)
