2000 character limit reached
Abelian networks II. Halting on all inputs
Published 30 Aug 2014 in cs.FL, cond-mat.stat-mech, and math.CO | (1409.0169v2)
Abstract: 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 of its production matrix lie in the open unit disk.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.