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...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Mathematics and Theoretical Computer Science Vol. 24, no. 1; no. Automata, Logic and Semantics; pp. 1 - 37
Main Authors:	Ollinger, Nicolas, Theyssier, Guillaume
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.01.2022 Discrete Mathematics & Theoretical Computer Science
Subjects:	[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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!