Solution of some conjectures about topological properties of linear cellular automata
From MaRDI portal
Publication:1884850
DOI10.1016/j.tcs.2004.06.008zbMath1071.68066OpenAlexW2033598139WikidataQ122937596 ScholiaQ122937596MaRDI QIDQ1884850
Alberto Dennunzio, Gianpiero Cattaneo, Luciano Margara
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.06.008
Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)
Related Items (26)
\(m\)-asynchronous cellular automata: from fairness to quasi-fairness ⋮ Computation of functions on \(n\) bits by asynchronous clocking of cellular automata ⋮ Solving the parity problem in one-dimensional cellular automata ⋮ Conservation of some dynamical properties for operations on cellular automata ⋮ Asynchronous cellular automata and dynamical properties ⋮ On the Bernoulli automorphism of reversible linear cellular automata ⋮ 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 ⋮ 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\) ⋮ The impact of alphabet size on pattern complexity of maxmin-\( \omega\) cellular automata ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata ⋮ An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption ⋮ Computing the periods of preimages in surjective cellular automata ⋮ Sand piles: from physics to cellular automata models ⋮ On the dynamical behaviour of linear higher-order cellular automata and its decidability ⋮ Decidable Properties of 2D Cellular Automata ⋮ Three research directions in non-uniform cellular automata ⋮ A family of sand automata ⋮ An efficiently computable characterization of stability and instability for linear cellular automata ⋮ Dynamical behavior of additive cellular automata over finite abelian groups ⋮ Some Formal Properties of Asynchronous Cellular Automata ⋮ Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties ⋮ On the directional dynamics of additive cellular automata ⋮ A survey on transitivity in discrete time dynamical systems. application to symbolic systems and related languages
Cites Work
- Linear cellular automata over \(Z_ m\)
- Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects
- Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos
- Rice's theorem for the limit sets of cellular automata
- Ergodicity of linear cellular automata over \({\mathbb Z}_{m}\)
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- On the Limit Sets of Cellular Automata
- On Devaney's Definition of Chaos
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solution of some conjectures about topological properties of linear cellular automata
