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.
@article{arxiv.1501.03992,
title = {PSPACE-Completeness of Majority Automata Networks},
author = {Eric Goles and Pedro Montealegre and Ville Salo and Ilkka Törmä},
journal= {arXiv preprint arXiv:1501.03992},
year = {2015}
}