Skip to Main content Skip to Navigation

# On the Computational Complexity of the Freezing Non-strict Majority Automata

Abstract : Consider a two dimensional lattice with the von Neumann neighborhood such that each site has a value belonging to $\{0,1\}$ which changes state following a freezing non-strict majority rule, i.e., sites at state 1 remain unchanged and those at 0 change iff two or more of it neighbors are at state 1. We study the complexity of the decision problem consisting in to decide whether an arbitrary site initially in state 0 will change to state 1. We show that the problem in the class $\mathbf{NC}$ proving a characterization of the maximal sets of stable sites as the tri-connected components.
Document type :
Conference papers
Domain :
Complete list of metadata

Cited literature [14 references]

https://hal.inria.fr/hal-01656355
Contributor : Hal Ifip <>
Submitted on : Tuesday, December 5, 2017 - 3:42:20 PM
Last modification on : Tuesday, March 17, 2020 - 3:01:02 AM

### File

447449_1_En_9_Chapter.pdf
Files produced by the author(s)

### Licence

Distributed under a Creative Commons Attribution 4.0 International License

### Citation

Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger. On the Computational Complexity of the Freezing Non-strict Majority Automata. 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. pp.109-119, ⟨10.1007/978-3-319-58631-1_9⟩. ⟨hal-01656355⟩

Record views

Files downloads