Local rule distributions, language complexity and non-uniform cellular automata
From MaRDI portal
Publication:393151
DOI10.1016/j.tcs.2012.05.013zbMath1297.68176OpenAlexW2006435955MaRDI QIDQ393151
Julien Provillard, Alberto Dennunzio, Enrico Formenti
Publication date: 16 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.013
Related Items (17)
\(m\)-asynchronous cellular automata: from fairness to quasi-fairness ⋮ Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) ⋮ Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues ⋮ Complexity of the dynamics of reaction systems ⋮ Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption ⋮ Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ On linear non-uniform cellular automata: duality and dynamics ⋮ Topological dynamics of nondeterministic cellular automata ⋮ On invertible and stably reversible non-uniform cellular automata ⋮ On the dynamical behaviour of linear higher-order cellular automata and its decidability ⋮ Three research directions in non-uniform cellular automata ⋮ An efficiently computable characterization of stability and instability for linear cellular automata ⋮ Computational complexity of finite asynchronous cellular automata ⋮ Dynamical behavior of additive cellular automata over finite abelian groups ⋮ Nilpotency and periodic points in non-uniform cellular automata ⋮ Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Non-uniform cellular automata: classes, dynamics, and decidability
- Conservation of some dynamical properties for operations on cellular automata
- Sand automata as cellular automata
- On the directional dynamics of additive cellular automata
- Finite acceptance of infinite words
- Number-conserving cellular automata I: Decidability.
- On the undecidability of the limit behavior of cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Non-uniform Cellular Automata
- The Nilpotency Problem of One-Dimensional Cellular Automata
- An Introduction to Symbolic Dynamics and Coding
- Endomorphisms and automorphisms of the shift dynamical system
- Decision problems forω-automata
This page was built for publication: Local rule distributions, language complexity and non-uniform cellular automata
