Weak Cost Register Automata are Still Powerful
DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018(2018)
摘要
We consider one of the weakest variants of cost register automata over a tropical semiring, namely copyless cost register automata over $\mathbb{N}$ with updates using $\min$ and increments. We show that this model can simulate, in some sense, the runs of counter machines with zero-tests. We deduce that a number of problems pertaining to that model are undecidable, in particular equivalence, disproving a conjecture of Alur et al. from 2012. To emphasize how weak these machines are, we also show that they can be expressed as a restricted form of linearly-ambiguous weighted automata.
更多查看译文
关键词
Cost register automata, semilinearity, equivalence
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络