A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Coverability Is undecidable in one-dimensional pushdown vector addition systems with resets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: What makes Petri nets harder to verify: stack or data? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hyper-Ackermannian bounds for pushdown vector addition systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On boundedness problems for pushdown vector addition systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The reachability problem for Petri nets is not elementary / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of membership problems for circuits over sets of integers / rank | |||
Normal rank | |||
Latest revision as of 17:51, 24 July 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
0 references
