Decidable Properties of 2D Cellular Automata
From MaRDI portal
Publication:3533017
DOI10.1007/978-3-540-85780-8_21zbMATH Open1161.68602OpenAlexW1555850717MaRDI QIDQ3533017FDOQ3533017
Authors: Alberto Dennunzio, Enrico Formenti 
Publication date: 30 October 2008
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_21
Recommendations
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- From one-dimensional to two-dimensional cellular automata
- Two-dimensional languages and cellular automata
- Decidability and undecidability in cellular automata
- Topological Dynamics of 2D Cellular Automata
Cites Work
- Endomorphisms and automorphisms of the shift dynamical system
- Title not available (Why is that?)
- Reversibility and surjectivity problems of cellular automata
- Solution of some conjectures about topological properties of linear cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Title not available (Why is that?)
- Periodic points for onto cellular automata
- A new dimension sensitive property for cellular automata
- Topological Dynamics of 2D Cellular Automata
- Title not available (Why is that?)
- Computational complexity of dynamical systems: the case of cellular automata
- Shifting and Lifting of Cellular Automata
- Title not available (Why is that?)
Cited In (16)
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Non-uniform cellular automata: classes, dynamics, and decidability
- More decision algorithms for global properties of 1D cellular automata
- Conservation of some dynamical properties for operations on cellular automata
- Sand automata as cellular automata
- On the directional dynamics of additive cellular automata
- On the undecidability of the limit behavior of cellular automata
- Mathematical Foundations of Computer Science 2004
- Asynchronous cellular automata and dynamical properties
- A family of sand automata
- From one-dimensional to two-dimensional cellular automata
- Characterization of two-dimensional cellular automata over ternary fields
- Non-uniform Cellular Automata
- Nondeterministic cellular automata
- Some Formal Properties of Asynchronous Cellular Automata
This page was built for publication: Decidable Properties of 2D Cellular Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533017)
