Freezing, Bounded-Change and Convergent Cellular Automata

This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes a bounded number of state changes in any orbit, and finally...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Mathematics and Theoretical Computer Science Jg. 24, no. 1; H. Automata, Logic and Semantics; S. 1 - 37
Hauptverfasser:	Ollinger, Nicolas, Theyssier, Guillaume
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Nancy DMTCS 01.01.2022 Discrete Mathematics & Theoretical Computer Science
Schlagworte:	[info.info-cc]computer science [cs]/computational complexity [cs.cc] [info.info-dm]computer science [cs]/discrete mathematics [cs.dm] [math.math-ds]mathematics [math]/dynamical systems [math.ds] Cellular automata complexity computability Computational Complexity Computer Science Convergence (Mathematics) convergent cellular automata Discrete Mathematics Dynamical Systems Freezing freezing cellular automata Mathematical research Mathematics France computability complexity convergent cellular automata freezing cellular automata
ISSN:	1365-8050, 1462-7264, 1365-8050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!