Universality and decidability of number-conserving cellular automata
نویسندگان
چکیده
منابع مشابه
Universality and decidability of number-conserving cellular automata
Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the definition of the property to include cellular automata with any set of states in Z, and show that they can be always extended to “usual” NCCA with contiguous state...
متن کاملNumber-conserving cellular automata I: decidability
We prove that de6nitions of number-conserving cellular automata found in literature are equivalent. A necessary and su9cient condition for cellular automata to be number-conserving is proved. Using this condition, we give a quasi-linear time algorithm to decide number-conservation. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملNumber conserving cellular automata: new results on decidability and dynamics
In the last ten years number conserving cellular automata (NCA) have received greater and greater attention. This interest is confirmed by the hundreds of papers in international conferences or journals since their introduction in [15]. They essentially model particle systems ruled by conservation laws of mass or energy with applications in a wide range of scientific disciplines. For example, t...
متن کاملUniversality of One-Dimensional Reversible and Number-Conserving Cellular Automata
We study one-dimensional reversible and number-conserving cellular automata (RNCCA) that have both properties of reversibility and number-conservation. In the case of 2-neighbor RNCCA, Garcı́aRamos proved that every RNCCA shows trivial behavior in the sense that all the signals in the RNCCA do not interact each other. However, if we increase the neighborhood size, we can find many complex RNCCAs...
متن کاملNumber-Conserving Reversible Cellular Automata and Their Computation-Universality
We introduce a new model of cellular automaton called a one-dimensional number-conserving partitioned cellular automaton (NC-PCA). An NC-PCA is a system such that a state of a cell is represented by a triple of non-negative integers, and the total (i.e., sum) of integers over the connguration is conserved throughout its evolving (computing) process. It can be thought as a kind of modelization o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00065-8