On the computational complexity of the freezing non-strict majority automata
From MaRDI portal
Publication:1704107
DOI10.1007/978-3-319-58631-1_9zbMath1451.68147OpenAlexW2611536776MaRDI QIDQ1704107
Diego Maldonado, Nicolas Ollinger, Pedro Montealegre, Eric Goles Chacc
Publication date: 8 March 2018
Full work available at URL: https://hal.inria.fr/hal-01656355/file/447449_1_En_9_Chapter.pdf
Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Descriptive complexity and finite models (68Q19)
Related Items (5)
Cellular automata and bootstrap percolation ⋮ Majority rule cellular automata ⋮ Freezing sandpiles and Boolean threshold networks: equivalence and complexity ⋮ Sandpile toppling on Penrose tilings: identity and isotropic dynamics ⋮ Freezing, Bounded-Change and Convergent Cellular Automata
This page was built for publication: On the computational complexity of the freezing non-strict majority automata
