The following pages link to Alberto Dennunzio (Q269779):
Displaying 36 items.
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness (Q269781) (← links)
- Local rule distributions, language complexity and non-uniform cellular automata (Q393151) (← links)
- Three research directions in non-uniform cellular automata (Q475396) (← links)
- Reaction systems and extremal combinatorics properties (Q496044) (← links)
- Computational complexity of finite asynchronous cellular automata (Q517039) (← links)
- Non-uniform cellular automata: classes, dynamics, and decidability (Q714501) (← links)
- Conservation of some dynamical properties for operations on cellular automata (Q837159) (← links)
- Sand automata as cellular automata (Q837187) (← links)
- Ancestors, descendants, and gardens of Eden in reaction systems (Q896703) (← links)
- (Q1034601) (redirect page) (← links)
- On the directional dynamics of additive cellular automata (Q1034602) (← links)
- Solution of some conjectures about topological properties of linear cellular automata (Q1884850) (← links)
- Surjective multidimensional cellular automata are non-wandering: a combinatorial proof (Q1941707) (← links)
- Dynamical behavior of additive cellular automata over finite abelian groups (Q2003993) (← links)
- On the dynamical behaviour of linear higher-order cellular automata and its decidability (Q2215107) (← links)
- An efficiently computable characterization of stability and instability for linear cellular automata (Q2229949) (← links)
- Decidability of sensitivity and equicontinuity for linear higher-order cellular automata (Q2278265) (← 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)
- Reachability in Resource-Bounded Reaction Systems (Q2798751) (← links)
- Preimage Problems for Reaction Systems (Q2799204) (← links)
- (Q2811211) (← links)
- (Q2883186) (← links)
- Computational Complexity of Rule Distributions of Non-uniform Cellular Automata (Q2890192) (← links)
- Acceptance Conditions for ω-Languages (Q3167506) (← links)
- A survey on transitivity in discrete time dynamical systems. application to symbolic systems and related languages (Q3431444) (← links)
- (Q3449995) (← links)
- (Q3507547) (← links)
- Decidable Properties of 2D Cellular Automata (Q3533017) (← links)
- A Full Cellular Automaton to Simulate Predator-Prey Systems (Q3540021) (← links)
- Non-uniform Cellular Automata (Q3618590) (← links)
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties (Q5092431) (← links)
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption (Q6064475) (← links)
- Search space reduction of asynchrony immune cellular automata (Q6151171) (← links)
- An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption (Q6179977) (← links)
- Computing the periods of preimages in surjective cellular automata (Q6191202) (← links)
