The following pages link to (Q2883186):
Displaying 17 items.
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness (Q269781) (← links)
- Synchronous cellular automata-based scheduler initialized by heuristic and modeled by a pseudo-linear neighborhood (Q272772) (← links)
- Explicit routing schemes for implementation of cellular automata on processor arrays (Q272775) (← links)
- Three research directions in non-uniform cellular automata (Q475396) (← links)
- Dynamical behavior of additive cellular automata over finite abelian groups (Q2003993) (← links)
- An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata (Q2077625) (← links)
- Topological dynamics of nondeterministic cellular automata (Q2201791) (← links)
- Efficient enumeration of three-state two-dimensional number-conserving cellular automata (Q2201793) (← links)
- Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations (Q2201797) (← links)
- On the dynamical behaviour of linear higher-order cellular automata and its decidability (Q2215107) (← links)
- Complexity of the dynamics of reaction systems (Q2417853) (← links)
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) (Q2666860) (← links)
- (Q5010161) (← links)
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties (Q5092431) (← links)
- Turing-completeness of asynchronous non-camouflage cellular automata (Q5918964) (← links)
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption (Q6064475) (← links)
- A class of discrete dynamical systems with properties of both cellular automata and L-systems (Q6151182) (← links)
