Abelian networks. II: Halting on all inputs (Q907072)

Abelian networks are (deterministic) systems of communicating automata satisfying a local commutativity condition. A countably infinite abelian network can emulate a Turing machine with infinite tape, i.e., the halting problem is undecidable for them in general. Here it is shown that a finite irreducible abelian network halts on all inputs if and only if all eigenvalues of its production matrix lie in the open unit disk. For Part I see [the authors, SIAM J. Discrete Math. 30, No. 2, 856--874 (2016; Zbl 1356.68072)].