Pages that link to "Item:Q714501"

The following pages link to Non-uniform cellular automata: classes, dynamics, and decidability (Q714501):

Displaying 24 items.

• \(m\)-asynchronous cellular automata: from fairness to quasi-fairness (Q269781) (← links)
• Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues (Q385957) (← links)
• Local rule distributions, language complexity and non-uniform cellular automata (Q393151) (← links)
• Three research directions in non-uniform cellular automata (Q475396) (← links)
• Realization problems for nonuniform cellular automata (Q475398) (← links)
• Computational complexity of finite asynchronous cellular automata (Q517039) (← links)
• Logical gates on gliders in restricted space domain cellular automata (Q831683) (← links)
• Supercritical probabilistic cellular automata: how effective is the synchronous updating? (Q2003484) (← links)
• Asynchronous Boolean networks and hereditarily bijective maps (Q2003487) (← links)
• Minimization and equivalence in multi-valued logical models of regulatory networks (Q2003489) (← links)
• Dynamical behavior of additive cellular automata over finite abelian groups (Q2003993) (← links)
• Nilpotency and periodic points in non-uniform cellular automata (Q2041685) (← links)
• A study of chaos in non-uniform cellular automata (Q2206541) (← 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)
• Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) (Q2666860) (← links)
• On invertible and stably reversible non-uniform cellular automata (Q2699949) (← 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)
• 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)
• On linear non-uniform cellular automata: duality and dynamics (Q6204177) (← links)
• Non-uniform number-conserving elementary cellular automata on the infinite grid: a tale of the unexpected (Q6488774) (← links)
• Non-uniform number-conserving elementary cellular automata (Q6496149) (← links)