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 this page instead for the normal view: P-hardness of the emptiness problem for visibly pushdown languages |
scientific article; zbMATH DE number 6149182
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
