On the computational complexity of the freezing non-strict majority automata

Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

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 NC proving a characterization of the maximal sets of stable sites as the tri-connected components.

Original languageEnglish
Title of host publicationCellular Automata and Discrete Complex Systems - 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Proceedings
EditorsAlberto Dennunzio, Luca Manzoni, Antonio E. Porreca, Enrico Formenti
PublisherSpringer Verlag
Pages109-119
Number of pages11
ISBN (Print)9783319586304
DOIs
StatePublished - 2017
Event23rd IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2017 - Milan, Italy
Duration: 7 Jun 20179 Jun 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10248 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2017
Country/TerritoryItaly
CityMilan
Period7/06/179/06/17

Fingerprint

Dive into the research topics of 'On the computational complexity of the freezing non-strict majority automata'. Together they form a unique fingerprint.

Cite this