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...
Main Authors: | Nicolas Ollinger, Guillaume Theyssier |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2022-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/5734/pdf |
Similar Items
-
Representing Reversible Cellular Automata with Reversible Block Cellular Automata
by: Jérôme Durand-Lose
Published: (2001-01-01) -
Asynchronous Cellular Automata and Brownian Motion
by: Philippe Chassaing, et al.
Published: (2007-01-01) -
Influence of the tie-break rule on the end-vertex problem
by: Pierre Charbit, et al.
Published: (2014-07-01) -
Constrained ear decompositions in graphs and digraphs
by: Frédéric Havet, et al.
Published: (2019-09-01) -
Some exactly solvable models of urn process theory
by: Philippe Flajolet, et al.
Published: (2006-01-01)