Binary reachability of timed-register pushdown automata and branching vector addition systems (Q4972152)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Binary reachability of timed-register pushdown automata and branching vector addition systems |
scientific article; zbMATH DE number 7135652
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9087211489677428
0 references
0.8382411599159241
0 references
0.8220151662826538
0 references
0.8177719116210938
0 references
