Deterministic one-counter automata
作者：
Highlights：
•
摘要
The equivalence problem for deterministic one-counter automata is shown to bedecidable. A corollary for schema theory is that equivalence is decidable for Ianov schemas with an auxiliary counter.
论文关键词：
论文评审过程：Received 15 January 1974, Available online 27 December 2007.
论文官网地址：https://doi.org/10.1016/S0022-0000(75)80005-5
