PSPACE-Completeness of Majority Automata Networks
arXiv:1501.03992
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.
14 pages, 8 figures