Computational complexity of finite asynchronous cellular automata
type: Item
instance of: scholarly article
title: Computational complexity of finite asynchronous cellular automata
zbMATH Open document ID: 1359.68207
author: Alberto Dennunzio
author: Enrico Formenti
author: Luca Manzoni
author: Giancarlo Mauri
author: Antonio E. Porreca
published in: Theoretical Computer Science
publication date: 2017-03-16T00:00:00Z
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6695328
zbMATH Keywords: natural computing
zbMATH Keywords: asynchronous cellular automata
zbMATH Keywords: computational complexity
Wikidata QID: Q57518141
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.12.003
OpenAlex ID: W2212525746
cites work: Conservation of some dynamical properties for operations on cellular automata
cites work: Surjective multidimensional cellular automata are non-wandering: a combinatorial proof
cites work: Q3805907
cites work: Computing Issues of Asynchronous CA
cites work: Limit properties of doubly quiescent \(m\)-asynchronous elementary cellular automata
cites work: \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
cites work: Non-uniform cellular automata: classes, dynamics, and decidability
cites work: Local rule distributions, language complexity and non-uniform cellular automata
cites work: Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
cites work: Q4451022
cites work: Fully asynchronous behavior of double-quiescent elementary cellular automata
cites work: Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
cites work: Q4198056
cites work: Nondeterministic Space is Closed under Complementation
cites work: Theory of cellular automata: a survey
cites work: Periodicity and Immortality in Reversible Computing
cites work: Asynchronous cellular automata and dynamical properties
cites work: Q3221403
cites work: The polynomial-time hierarchy
cites work: On the computational complexity of finite cellular automata
DOI: 10.1016/J.TCS.2015.12.003
DBLP publication ID: journals/tcs/DennunzioFMMP17
description: scientific article; zbMATH DE number 6695328