A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:43, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the coverability problem in acyclic pushdown VAS |
scientific article |
Statements
A lower bound for the coverability problem in acyclic pushdown VAS (English)
0 references
11 March 2021
0 references
theory of computation
0 references
context-free grammars
0 references
pushdown vector addition systems
0 references
one-counter machines
0 references
coverability problem
0 references
