Pattern growth in elementary cellular automata
Theoretical Computer Science
Models of massive parallelism: analysis of cellular automata and neural networks
Models of massive parallelism: analysis of cellular automata and neural networks
Number-conserving cellular automaton rules
Fundamenta Informaticae - Special issue on cellular automata
Number-conserving cellular automata I: decidability
Theoretical Computer Science
On conservative and monotone one-dimensional cellular automata and their particle representation
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
A new dimension sensitive property for cellular automata
Theoretical Computer Science - Mathematical foundations of computer science 2004
Remarks on the Critical Behavior of Second Order Additive Invariants in Elementary Cellular Automata
Fundamenta Informaticae - Special issue on DLT'04
On the Relationship Between Boolean and Fuzzy Cellular Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
On universality of radius 1/2 number-conserving cellular automata
UC'10 Proceedings of the 9th international conference on Unconventional computation
On factor universality in symbolic spaces
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the relationship between fuzzy and Boolean cellular automata
Theoretical Computer Science
Communication complexity in number-conserving and monotone cellular automata
Theoretical Computer Science
Fluctuation-driven computing on number-conserving cellular automata
Information Sciences: an International Journal
Remarks on the Critical Behavior of Second Order Additive Invariants in Elementary Cellular Automata
Fundamenta Informaticae - Special issue on DLT'04
| Hi-index | 0.00 |
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 states. We show a way to simulate any one dimensional CA through a one-dimensional NCCA, proving the existence of intrinsically universal NCCA. Finally, we give an algorithm to decide, given a CA, if its states can be labeled with integers to produce a NCCA, and to find this relabeling if the answer is positive.