P-hardness of the emptiness problem for visibly pushdown languages (Q1944895)
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 6149182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | P-hardness of the emptiness problem for visibly pushdown languages |
scientific article; zbMATH DE number 6149182 |
Statements
P-hardness of the emptiness problem for visibly pushdown languages (English)
0 references
28 March 2013
0 references
formal languages
0 references
complexity
0 references
0.7882301211357117
0 references
0.785883367061615
0 references
0.7743710279464722
0 references
0.7703538537025452
0 references
0.7668411135673523
0 references
