The word problem distinguishes counter languages
英文摘要：
Counter automata are more powerful versions of finite-state automata where addition and subtraction operations are permitted on a set of n integer registers, called counters. We show that the word problem of $\Z^n$ is accepted by a nondeterministic $m$-counter automaton if and only if $m \geq n$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
