PSPACE-completeness of majority automata networks

Eric Goles, Pedro Montealegre, Ville Salo, Ilkka Törmä

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

We study the dynamics of majority automata networks when the vertices are updated according to a block sequential updating scheme. In particular, we show that the complexity of the problem of predicting an eventual state change in some vertex, given an initial configuration, is PSPACE-complete.

Original languageEnglish
Pages (from-to)118-128
Number of pages11
JournalTheoretical Computer Science
Volume609
DOIs
StatePublished - 4 Jan 2016

Keywords

  • Boolean network
  • Majority network
  • PSPACE
  • Prediction problem

Fingerprint

Dive into the research topics of 'PSPACE-completeness of majority automata networks'. Together they form a unique fingerprint.

Cite this