Number conserving cellular automata II: dynamics

Authors:
Enrico Formenti;Aristide Grange
Affiliations:
Laboratoire d'Informatique Fondamentale de Marseille (LIF), Centre de Mathématique et, Informatique (CMI), 39 rue Joliot-Curie, 13453 Marseille Cedex 13, France;Laboratoire d'Informatique Théorique et Appliquée (LITA), Université de Metz, Île du Saulcy, 57045 Metz Cedex 01, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 11
Cited 12

Undecidability of CA classification schemes

Complex Systems
On the limit sets of cellular automata

SIAM Journal on Computing
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
Pattern growth in elementary cellular automata

Theoretical Computer Science
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Generalized sub-shifts in elementary cellular automata: the “strange case” of chaotic rule 180

Theoretical Computer Science
Ergodicity, transitivity, and regularity for linear cellular automata over Zm1

Theoretical Computer Science
Number-conserving cellular automaton rules

Fundamenta Informaticae - Special issue on cellular automata
Inducing an Order on Cellular Automata by a Grouping Operation

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Number-conserving cellular automata I: decidability

Theoretical Computer Science

Number-conserving cellular automata I: decidability

Theoretical Computer Science
Cellular automata with vanishing particles

Fundamenta Informaticae - Special issue on 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
Conservation of some dynamical properties for operations on cellular automata

Theoretical Computer Science
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 the relationship between fuzzy and Boolean cellular 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
Cellular automata with vanishing particles

Fundamenta Informaticae - Cellular Automata
From One-dimensional to Two-dimensional Cellular Automata

Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper studies properties of almost periodic sequences (also known as uniformly recursive).A sequence is almost periodic if for every finite string that ccurs infinitely many times in the sequence there exists a number m such that every segment ...