Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems (Q4972152)

From MaRDI portal
Revision as of 12:29, 31 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127707694, #quickstatements; #temporary_batch_1722421251154)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7135652
Language Label Description Also known as
English
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems
scientific article; zbMATH DE number 7135652

    Statements

    Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 November 2019
    0 references
    0 references
    timed automata
    0 references
    branching vector addition systems
    0 references
    pushdown automata
    0 references
    timed-register pushdown automata
    0 references
    0 references
    0 references