Two-dimensional languages and cellular automata
From MaRDI portal
Publication:2909191
DOI10.1142/S0129054112500037zbMATH Open1283.68227MaRDI QIDQ2909191FDOQ2909191
Recommendations
- A note on decidability of cellularity
- Towards a Rice Theorem on Traces of Cellular Automata
- A comparison of finite and cellular automata
- Formal languages and global cellular automaton behavior
- Decidability and undecidability in cellular automata
- Ultimate traces of cellular automata
- Machines, Computations, and Universality
- Mathematical Foundations of Computer Science 2004
- scientific article; zbMATH DE number 4195191
- scientific article; zbMATH DE number 4215382
Cites work
- An Introduction to Symbolic Dynamics and Coding
- Dynamical behaviour of Coven's aperiodic cellular automata
- Equicontinuity and sensitivity of nondeterministic cellular automata
- Languages, equicontinuity and attractors in cellular automata
- Multiplicities of covers for sofic shifts
- On Complexity of Two Dimensional Languages Generated by Transducers
- The Nilpotency Problem of One-Dimensional Cellular Automata
Cited in
(11)- Local rule distributions, language complexity and non-uniform cellular automata
- scientific article; zbMATH DE number 2150293 (Why is no real title available?)
- A note on decidability of cellularity
- Finite State Automata Representing Two-Dimensional Subshifts
- TRANSITIVITY IN TWO-DIMENSIONAL LOCAL LANGUAGES DEFINED BY DOT SYSTEMS
- From one-dimensional to two-dimensional cellular automata
- A Language for Particle Interactions in Rule 54 and Other Cellular Automata
- Complexity of two-dimensional patterns
- Two-dimensional cellular automata
- On Some Classes of 2D Languages and Their Relations
- Decidable Properties of 2D Cellular Automata
This page was built for publication: Two-dimensional languages and cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909191)
