Number-conserving cellular automata I: Decidability.
type: Item
instance of: scholarly article
title: Number-conserving cellular automata I: Decidability.
zbMATH Open document ID: 1042.68076
DOI: 10.1016/S0304-3975(02)00534-0
author: Bruno Durand
author: Enrico Formenti
author: Zsuzsanna Róka
published in: Theoretical Computer Science
publication date: 2003-05-25T00:00:00Z
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 1915584
zbMATH Keywords: Cellular automata
zbMATH Keywords: Decidability
MaRDI profile type: Publication
cites work: Cellular automaton rules conserving the number of active sites
cites work: Q4799363
cites work: Q4501557
cites work: The surjectivity problem for 2D cellular automata
cites work: Number conserving cellular automata. II: Dynamics.
cites work: Q3997383
cites work: Endomorphisms and automorphisms of the shift dynamical system
cites work: Reversibility and surjectivity problems of cellular automata
cites work: Rice's theorem for the limit sets of cellular automata
cites work: Number-conserving reversible cellular automata and their computation-universality
cites work: Q4544350
cites work: Q4868590
cites work: Cellular automata and modeling of complex physical systems. Proceedings of the Winter School, Les Houches, France, February 21 - 28, 1989
full work available at URL: s0304-3975(02)00534-0
OpenAlex ID: W2056487410
description: scientific article; zbMATH DE number 1915584