A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3112000701 / rank
 
Normal rank

Revision as of 21:38, 19 March 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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 March 2021
    0 references
    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