A fast parallel algorithm for the robust prediction of the two-dimensional strict majority automaton

Eric Goles, Pedro Montealegre

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

2 Scopus citations

Abstract

Consider the robust prediction problem for some automaton as the one consisting in determine, given an initial configuration, if there exists a nonzero probability that some selected site change states, when the network is updated picking one site at a time uniformly at random. We show that the robust prediction is in NC for the two-dimensional, von Neumann neighborhood, strict majority automaton.

Original languageEnglish
Title of host publicationCellular Automata - 12th International Conference on Cellular Automata for Research and Industry, ACRI 2016, Proceedings
EditorsJarosław Wąs, Stefania Bandini, Samira El Yacoubi
PublisherSpringer Verlag
Pages166-175
Number of pages10
ISBN (Print)9783319443645
DOIs
StatePublished - 2016
Externally publishedYes
Event12th International Conference on Cellular Automata for Research and Industry, ACRI 2016 - Fez, Morocco
Duration: 5 Sep 20168 Sep 2016

Publication series

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

Conference

Conference12th International Conference on Cellular Automata for Research and Industry, ACRI 2016
Country/TerritoryMorocco
CityFez
Period5/09/168/09/16

Keywords

  • Asynchronous automata
  • Bootstap percolation
  • Computational complexity
  • Fast parallel algorithm
  • Majority automata
  • Prediction problem

Fingerprint

Dive into the research topics of 'A fast parallel algorithm for the robust prediction of the two-dimensional strict majority automaton'. Together they form a unique fingerprint.

Cite this