PSPACE-completeness of majority automata networks

Eric Goles, Pedro Montealegre, Ville Salo, Ilkka Törmä
2016 Theoretical Computer Science  
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.
doi:10.1016/j.tcs.2015.09.014 fatcat:ua2jumar4bgs3cavptktjyaoby