Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems (Q4972152): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q127707694, #quickstatements; #temporary_batch_1722421251154 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2948751124 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127707694 / rank | |||
Normal rank | |||
Latest revision as of 12:29, 31 July 2024
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
22 November 2019
0 references
timed automata
0 references
branching vector addition systems
0 references
pushdown automata
0 references
timed-register pushdown automata
0 references
