Universality and decidability of number-conserving cellular automata
From MaRDI portal
Publication:1870564
DOI10.1016/S0304-3975(02)00065-8zbMath1026.68094arXivnlin/0306032WikidataQ56750188 ScholiaQ56750188MaRDI QIDQ1870564
Publication date: 14 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/nlin/0306032
Related Items (15)
On conservative and monotone one-dimensional cellular automata and their particle representation ⋮ Number-conserving cellular automata with a von Neumann neighborhood of range one ⋮ On the relationship between fuzzy and Boolean cellular automata ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Efficient enumeration of three-state two-dimensional number-conserving cellular automata ⋮ A decomposition theorem for number-conserving multi-state cellular automata on triangular grids ⋮ Fluctuation-driven computing on number-conserving cellular automata ⋮ Realization problems for nonuniform cellular automata ⋮ Communication complexity in number-conserving and monotone cellular automata ⋮ On the Relationship Between Boolean and Fuzzy Cellular Automata ⋮ Construction of One-Dimensional Nonuniform Number Conserving Elementary Cellular Automata Rules ⋮ 5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal ⋮ A new dimension sensitive property for cellular automata ⋮ EVENTUALLY NUMBER-CONSERVING CELLULAR AUTOMATA ⋮ Freezing, Bounded-Change and Convergent Cellular Automata
Cites Work
- Pattern growth in elementary cellular automata
- Number conserving cellular automata. II: Dynamics.
- Number-conserving cellular automata I: Decidability.
- On conservative and monotone one-dimensional cellular automata and their particle representation
- Cellular automaton rules conserving the number of active sites
- Languages, equicontinuity and attractors in cellular automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Universality and decidability of number-conserving cellular automata