Emptiness of ordered multi-pushdown automata is 2ETIME-complete (Q4639894)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6868311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Emptiness of ordered multi-pushdown automata is 2ETIME-complete |
scientific article; zbMATH DE number 6868311 |
Statements
Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete (English)
0 references
14 May 2018
0 references
multi-pushdown automata
0 references
emptiness problem
0 references
0.9455037713050842
0 references
0.8559868931770325
0 references
0.7843958139419556
0 references
0.7805248498916626
0 references
0.7768168449401855
0 references
