择多自动机网络的PSPACE-完备性
PSPACE-Completeness of Majority Automata Networks
摘要:
我们研究了多数自动机网络的动态时,根据块顺序更新方案的顶点更新。特别是,我们表明,在某些顶点的预测最终状态变化的问题的复杂性,给定的初始配置,是PSPACE完成。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。