A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
PSPACE-completeness of majority automata networks
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