Pages that link to "Item:Q385957"
From MaRDI portal
The following pages link to Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues (Q385957):
Displayed 24 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)
- A family of sand automata (Q482286) (← links)
- Nondeterministic cellular automata (Q508657) (← links)
- A generalized neighborhood for cellular automata (Q511006) (← links)
- Computational complexity of finite asynchronous cellular automata (Q517039) (← links)
- Non-uniform cellular automata: classes, dynamics, and decidability (Q714501) (← links)
- Supercritical probabilistic cellular automata: how effective is the synchronous updating? (Q2003484) (← links)
- Dynamical behavior of additive cellular automata over finite abelian groups (Q2003993) (← links)
- On the conjugacy problem of cellular automata (Q2201790) (← links)
- Topological dynamics of nondeterministic cellular automata (Q2201791) (← links)
- Efficient enumeration of three-state two-dimensional number-conserving cellular automata (Q2201793) (← links)
- On the dynamical behaviour of linear higher-order cellular automata and its decidability (Q2215107) (← links)
- Reversibility problem of multidimensional finite cellular automata (Q2410073) (← links)
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) (Q2666860) (← links)
- Progress, gaps and obstacles in the classification of cellular automata (Q2670224) (← links)
- Hierarchy and Expansiveness in 2D Subshifts of Finite Type (Q2799188) (← 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)
- Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) (Q6118641) (← links)
- A survey of cellular automata: types, dynamics, non-uniformity and applications (Q6151179) (← links)
- Computing the periods of preimages in surjective cellular automata (Q6191202) (← links)