Number-conserving cellular automata I: decidability

Authors:
Bruno Durand;Enrico Formenti;Zsuzsanna Róka
Affiliations:
Laboratoire d'Informatique Fondamentale de Marseille (LIF), 39 rue Joliot-Curie, 13453 Marseille Cedex 13, France;Laboratoire d'Informatique Fondamentale de Marseille (LIF), 39 rue Joliot-Curie, 13453 Marseille Cedex 13, France;Laboratoire d'Informatique Théorique et Appliquée (LITA), I.U.T. de Metz, Île du Saulcy, 57045 Metz Cedex 01, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 7
Cited 16

Cellular automata: theory and experiment

Cellular automata: theory and experiment
Rice's theorem for the limit sets of cellular automata

Theoretical Computer Science
Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
Regular Article: The surjectivity problem for 2D cellular automata

Proceedings of the 30th IEEE symposium on Foundations of computer science
Cellular Automata and Cooperative Systems

Cellular Automata and Cooperative Systems
Number-conserving cellular automaton rules

Fundamenta Informaticae - Special issue on cellular automata
Number conserving cellular automata II: dynamics

Theoretical Computer Science

Universality and decidability of number-conserving cellular automata

Theoretical Computer Science - Algorithms,automata, complexity and games
Number conserving cellular automata II: dynamics

Theoretical Computer Science
Cellular automata with vanishing particles

Fundamenta Informaticae - Special issue on cellular automata
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
Fundamental study: From sandpiles to sand automata

Theoretical Computer Science
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)
The most general conservation law for a cellular automaton

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On universality of radius 1/2 number-conserving cellular automata

UC'10 Proceedings of the 9th international conference on Unconventional computation
On the relationship between fuzzy and Boolean cellular automata

Theoretical Computer Science
Fluctuation-driven computing on number-conserving cellular automata

Information Sciences: an International Journal
Computational complexity of rule distributions of non-uniform cellular automata

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Remarks on the Critical Behavior of Second Order Additive Invariants in Elementary Cellular Automata

Fundamenta Informaticae - Special issue on DLT'04
Cellular automata with vanishing particles

Fundamenta Informaticae - Cellular Automata
Local rule distributions, language complexity and non-uniform cellular automata

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider the class USk of uniformly k-sparse simple graphs, i.e., the class of finite or countable simple graphs, every finite subgraph of which has a number of edges bounded by k times the number of vertices. We prove ...