THE CONTEXT-FREENESS OF THE LANGUAGES ASSOCIATED WITH VECTOR ADDITION SYSTEMS IS DECIDABLE
THE CONTEXT-FREENESS OF THE LANGUAGES ASSOCIATED WITH VECTOR ADDITION SYSTEMS IS DECIDABLE
复制标题
DOI:
10.1016/0304-3975(92)90002-w
复制
发表时间:
1992-05-18
影响因子:
1.1
通讯作者:
SCHWER, SR
中科院分区:
文献类型:
--
作者:
SCHWER, SR
This paper introduces new tools designed for the study of the languages associated with vector addition systems or, equivalently, Petri nets. With these tools, we prove that the problem of deciding the context-freeness of such a language is solvable.