Non-uniform cellular automata: classes, dynamics, and decidability
From MaRDI portal
(Redirected from Publication:714501)
Abstract: The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like surjectivity and injectivity is also established. The final part studies a strong form of equicontinuity property specially suited for non-uniform cellular automata.
Recommendations
Cites work
- scientific article; zbMATH DE number 21231 (Why is no real title available?)
- scientific article; zbMATH DE number 605018 (Why is no real title available?)
- scientific article; zbMATH DE number 1070886 (Why is no real title available?)
- Computational complexity of rule distributions of non-uniform cellular automata
- Conservation of some dynamical properties for operations on cellular automata
- Decidable Properties of 2D Cellular Automata
- Endomorphisms and automorphisms of the shift dynamical system
- Languages, equicontinuity and attractors in cellular automata
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Non-uniform Cellular Automata
- On the directional dynamics of additive cellular automata
- On the dynamical behavior of chaotic cellular automata
- On the undecidability of the limit behavior of cellular automata
- Reversibility and surjectivity problems of cellular automata
- Sand automata as cellular automata
Cited in
(40)- A study of chaos in non-uniform cellular automata
- Nilpotency and periodic points in non-uniform cellular automata
- m-asynchronous cellular automata: from fairness to quasi-fairness
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Local rule distributions, language complexity and non-uniform cellular automata
- Equicontinuity and sensitivity of nondeterministic cellular automata
- Dynamical behavior of additive cellular automata over finite abelian groups
- Supercritical probabilistic cellular automata: how effective is the synchronous updating?
- An efficiently computable characterization of stability and instability for linear cellular automata
- Computational complexity of finite asynchronous cellular automata
- Scalability of non-uniform cellular automata having only point state attractors
- Simulation of non-uniform cellular automata by classical cellular automata and its application in embedded systems
- Stable finiteness of twisted group rings and noisy linear cellular automata
- On invertible and stably reversible non-uniform cellular automata
- Minimization and equivalence in multi-valued logical models of regulatory networks
- Asynchronous Boolean networks and hereditarily bijective maps
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- Non-uniform cellular automata
- Realization problems for nonuniform cellular automata
- Three research directions in non-uniform cellular automata
- Reachability problem in non-uniform cellular automata
- On linear non-uniform cellular automata: duality and dynamics
- scientific article; zbMATH DE number 880299 (Why is no real title available?)
- Temporally Stochastic Cellular Automata: Classes and Dynamics
- Non-uniform number-conserving elementary cellular automata on the infinite grid: a tale of the unexpected
- A comprehensive taxonomy of cellular automata
- Non-uniform number-conserving elementary cellular automata
- Bounds on Non-surjective Cellular Automata
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- Nondeterministic cellular automata
- Non-uniform Cellular Automata
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- Computational complexity of rule distributions of non-uniform cellular automata
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
- Topological dynamics of nondeterministic cellular automata
- Logical gates on gliders in restricted space domain cellular automata
- Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)
- On the surjunctivity and the Garden of Eden theorem for non-uniform cellular automata
- Uniform continuity of relations and nondeterministic cellular automata
This page was built for publication: Non-uniform cellular automata: classes, dynamics, and decidability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714501)
