REGULAR SEPARABILITY OF ONE COUNTER AUTOMATA
LOGICAL METHODS IN COMPUTER SCIENCE(2019)
摘要
The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other. Our main result is decidability, and PSPACE-completeness, of the regular separability problem for languages of one counter automata without zero tests (also known as one counter nets). This contrasts with undecidability of the regularity problem for one counter nets, and with undecidability of the regular separability problem for one counter automata, which is our second result.
更多查看译文
关键词
Regular separability problem,one counter automata,one counter nets,vector addition systems with states
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要