Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (Q3533004)
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: Emptiness of Multi-pushdown Automata Is 2ETIME-Complete |
scientific article; zbMATH DE number 5359021
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Emptiness of Multi-pushdown Automata Is 2ETIME-Complete |
scientific article; zbMATH DE number 5359021 |
Statements
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (English)
0 references
30 October 2008
0 references
0.9455037713050842
0 references
0.7878953814506531
0 references
0.7817429304122925
0 references
0.7788949012756348
0 references
0.7642111778259277
0 references
