On the dynamical behaviour of linear higher-order cellular automata and its decidability
From MaRDI portal
Publication:2215107
DOI10.1016/j.ins.2019.02.023zbMath1456.37019arXiv1902.06775OpenAlexW2912692298MaRDI QIDQ2215107
Enrico Formenti, Alberto Dennunzio, Luca Manzoni, Antonio E. Porreca, Luciano Margara
Publication date: 10 December 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.06775
cellular automatadecidabilitydiscrete dynamical systemslinear cellular automatahigher-order cellular automatasensitivity to the initial conditions
Related Items
Ternary reversible number-conserving cellular automata are trivial, 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\), The impact of alphabet size on pattern complexity of maxmin-\( \omega\) cellular automata, Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata, An efficiently computable characterization of stability and instability for linear cellular automata, Decidability in Group Shifts and Group Cellular Automata, Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties, Reversibility of non-saturated linear cellular automata on finite triangular grids, A split-and-perturb decomposition of number-conserving cellular automata, Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets, Recurrent Misconceptions in the Study of CA Reversibility on Triangular Grids, Two-dimensional codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(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
- Three research directions in non-uniform cellular automata
- Reaction systems and extremal combinatorics properties
- Computational complexity of finite asynchronous cellular automata
- Non-uniform cellular automata: classes, dynamics, and decidability
- Ancestors, descendants, and gardens of Eden in reaction systems
- A multisecret sharing scheme for color images based on cellular automata
- Linear cellular automata over \(Z_ m\)
- Algebraic properties of linear cellular automata
- Computation and construction universality of reversible cellular automata
- On computing the entropy of cellular automata.
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- Solution of some conjectures about topological properties of linear cellular automata
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- The faster higher-order cellular automaton for hyper-parallel undistorted data compression
- A secret sharing scheme based on cellular automata
- Chaos Without Nonperiodicity
- Languages, equicontinuity and attractors in cellular automata
- Embedded image coding using zerotrees of wavelet coefficients
- Computing Issues of Asynchronous CA
- Shifting and Lifting of Cellular Automata
- Endomorphisms and automorphisms of the shift dynamical system
