Local rule distributions, language complexity and non-uniform cellular automata
From MaRDI portal
Publication:393151
DOI10.1016/J.TCS.2012.05.013zbMATH Open1297.68176OpenAlexW2006435955MaRDI QIDQ393151FDOQ393151
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
Recommendations
Cites Work
- An Introduction to Symbolic Dynamics and Coding
- Endomorphisms and automorphisms of the shift dynamical system
- Title not available (Why is that?)
- On the directional dynamics of additive cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Title not available (Why is that?)
- Non-uniform Cellular Automata
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- The Nilpotency Problem of One-Dimensional Cellular Automata
- Non-uniform cellular automata: classes, dynamics, and decidability
- Conservation of some dynamical properties for operations on cellular automata
- Sand automata as cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite acceptance of infinite words
- Number-conserving cellular automata I: Decidability.
- On the undecidability of the limit behavior of cellular automata
- Title not available (Why is that?)
- Decision problems forω-automata
Cited In (24)
- 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
- Dynamical behavior of additive cellular automata over finite abelian groups
- An efficiently computable characterization of stability and instability for linear cellular automata
- Computational complexity of finite asynchronous cellular automata
- Stable finiteness of twisted group rings and noisy linear cellular automata
- On invertible and stably reversible non-uniform cellular automata
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- Complexity of the dynamics of reaction systems
- Three research directions in non-uniform cellular automata
- On linear non-uniform cellular automata: duality and dynamics
- Identification of Periodic Boundary SACA Rules Exploring NSRT Diagram
- 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
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
- An exploration of reversible septenary number-conserving cellular automata: a survey of known methods
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- Topological dynamics of nondeterministic 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
This page was built for publication: Local rule distributions, language complexity and non-uniform cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393151)
