| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435560 | Theoretical Computer Science | 2016 | 11 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Eric Goles, Pedro Montealegre, Ville Salo, Ilkka Törmä,