Three research directions in non-uniform cellular automata
From MaRDI portal
Publication:475396
DOI10.1016/j.tcs.2014.06.046zbMath1360.68611OpenAlexW1964135527MaRDI QIDQ475396
Alberto Dennunzio, Julien Provillard, Enrico Formenti
Publication date: 26 November 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.046
structural stabilitysymbolic dynamicsdecidability\(\zeta\)-rational languagesnon-uniform cellular automata
Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Symbolic dynamics (37B10)
Related Items (9)
Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) ⋮ 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 the dynamical behaviour of linear higher-order cellular automata and its decidability ⋮ An efficiently computable characterization of stability and instability for linear 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Non-uniform cellular automata: classes, dynamics, and decidability
- Conservation of some dynamical properties for operations on cellular automata
- The origins of combinatorics on words
- On the directional dynamics of additive cellular automata
- Reliable computation with cellular automata
- On topological dynamics of Turing machines
- Some properties of cellular automata with equicontinuity points
- On the hierarchy of conservation laws in a cellular automaton
- Number-conserving cellular automata I: Decidability.
- Solution of some conjectures about topological properties of linear cellular automata
- Surjective multidimensional cellular automata are non-wandering: a combinatorial proof
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- A Survey on m-Asynchronous Cellular Automata
- Acceptance Conditions for ω-Languages
- Non-uniform Cellular Automata
- Rekursive Folgenmengen I
- The Nilpotency Problem of One-Dimensional Cellular Automata
- Languages, equicontinuity and attractors in cellular automata
- An Introduction to Symbolic Dynamics and Coding
- Computing Issues of Asynchronous CA
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Developments in Language Theory
This page was built for publication: Three research directions in non-uniform cellular automata
