搜索结果: 1-1 共查到“数学 HALTING ON ALL INPUTS”相关记录1条 . 查询时间(0.051 秒)
Abelian networks are systems of communicating automata satisfying a local commutativity condition. We show that a finite irreducible abelian network halts on all inputs if and only if all eigenvalues ...