Computational Complexity of Rule Distributions of Non-uniform Cellular Automata

DOI10.1007/978-3-642-28332-1_18zbMath1350.68196OpenAlexW129777244MaRDI QIDQ2890192

Julien Provillard, Alberto Dennunzio, Enrico Formenti

Publication date: 8 June 2012

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28332-1_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)

Related Items (3)

Realization problems for nonuniform cellular automata ⋮ Non-uniform cellular automata: classes, dynamics, and decidability ⋮ Reachability problem in non-uniform cellular automata

This page was built for publication: Computational Complexity of Rule Distributions of Non-uniform Cellular Automata