EVENTUALLY NUMBER-CONSERVING CELLULAR AUTOMATA

DOI10.1142/S0129183107010310zbMATH Open1111.82032arXivcond-mat/0410563MaRDI QIDQ3434320FDOQ3434320

Authors: Nino Boccara 

Publication date: 25 April 2007

Published in: International Journal of Modern Physics C (Search for Journal in Brave)

Abstract: We present a preliminary study of a new class of two-input cellular automata called eventually number-conserving cellular automata characterized by the property of evolving after a finite number of time steps to states whose number of active sites remains constant. Eventually number-conserving cellular automata are models of open systems of interacting particles, that is, system of particles interacting with the external world, The particle aspect of eventually number-conserving cellular automata can be emphasized by the motion representation of the cellular automaton evolution rule. This new class of cellular automata contains, as strict subclasses, number-conserving cellular automata, monotone cellular automata, and cellular automata emulating number-conserving ones. Our main objective is to show that they are not what one might naively think they are.

Full work available at URL: https://arxiv.org/abs/cond-mat/0410563

Recommendations

• Number-conserving cellular automata I: Decidability.
• scientific article; zbMATH DE number 1886322
• Number conservation via particle flow in one-dimensional cellular automata
• Cellular automaton rules conserving the number of active sites
• scientific article; zbMATH DE number 2046046

zbMATH Keywords

cellular automatanumber-conserving

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Interacting particle systems in time-dependent statistical mechanics (82C22)

Cites Work

• Title not available (Why is that?)
• Number-conserving cellular automata I: Decidability.
• Modeling complex systems
• Universality and decidability of number-conserving cellular automata
• On conservative and monotone one-dimensional cellular automata and their particle representation
• Cellular automaton rules conserving the number of active sites
• Number conserving cellular automata. II: Dynamics.
• MOTION REPRESENTATION OF ONE-DIMENSIONAL CELLULAR AUTOMATON RULES

Cited In (11)

• The Most General Conservation Law for a Cellular Automaton
• Towards the definition of conservation degree for one-dimensional cellular automata rules
• Number-conserving cellular automata I: Decidability.
• Number-conserving cellular automata with a von Neumann neighborhood of range one
• Title not available (Why is that?)
• Construction of one-dimensional nonuniform number conserving elementary cellular automata rules
• Title not available (Why is that?)
• Title not available (Why is that?)
• Number conservation via particle flow in one-dimensional cellular automata
• Number conserving cellular automata. II: Dynamics.
• On the hierarchy of conservation laws in a cellular automaton

This page was built for publication: EVENTUALLY NUMBER-CONSERVING CELLULAR AUTOMATA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434320)