On conservative and monotone one-dimensional cellular automata and their particle representation
From MaRDI portal
Publication:1884852
DOI10.1016/j.tcs.2004.06.010zbMath1071.68068arXivnlin/0306040OpenAlexW2049450484MaRDI QIDQ1884852
Eric Goles Chacc, Andrés Moreira, Nino Boccara
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/nlin/0306040
Cellular automata (computational aspects) (68Q80) Dynamical systems in other branches of physics (quantum mechanics, general relativity, laser physics) (37N20) Dynamical aspects of cellular automata (37B15)
Related Items (13)
Characterization of random fluctuation-based computation in cellular automata ⋮ Statistical mechanics of surjective cellular automata ⋮ On the relationship between fuzzy and Boolean cellular automata ⋮ A decomposition theorem for number-conserving multi-state cellular automata on triangular grids ⋮ Fluctuation-driven computing on number-conserving cellular automata ⋮ On the hierarchy of conservation laws in a cellular automaton ⋮ Communication complexity in number-conserving and monotone cellular automata ⋮ Construction of One-Dimensional Nonuniform Number Conserving Elementary Cellular Automata Rules ⋮ A split-and-perturb decomposition of number-conserving cellular automata ⋮ MOTION REPRESENTATION OF ONE-DIMENSIONAL CELLULAR AUTOMATON RULES ⋮ A new dimension sensitive property for cellular automata ⋮ EVENTUALLY NUMBER-CONSERVING CELLULAR AUTOMATA ⋮ Universality and decidability of number-conserving cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ergodic properties and thermodynamic behavior of elementary reversible cellular automata. I. Basic properties.
- Pattern growth in elementary cellular automata
- Computational mechanics of cellular automata: an example
- Additive conserved quantities in discrete-time lattice dynamical systems
- Universality and decidability of number-conserving cellular automata
- Number-conserving cellular automata I: Decidability.
- Number-Conserving Reversible Cellular Automata and Their Computation-Universality
- Cellular automaton rules conserving the number of active sites
- Languages, equicontinuity and attractors in cellular automata
- Conservation laws in cellular automata
- Upper bound on the products of particle interactions in cellular automata
This page was built for publication: On conservative and monotone one-dimensional cellular automata and their particle representation