A lower bound for the coverability problem in acyclic pushdown VAS

Matthias Englert,Piotr Hofman,Slawomir Lasota,Ranko Lazic,Jerome Leroux,Juliusz Straszynski

Information Processing Letters（2021）

引用 6|浏览110

暂无评分

摘要

We investigate the coverability problem for a one-dimensional restriction of pushdown vector addition systems with states. We improve the lower complexity bound to PSPACE, even in the acyclic case. (C) 2020 Elsevier B.V. All rights reserved.

查看译文

关键词

Theory of computation,Context-free grammars,Pushdown vector addition systems,One-counter machines,Coverability problem

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要