On the complexity of membership and counting in height-deterministic pushdown automata (Q3589625)
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 5788670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of membership and counting in height-deterministic pushdown automata |
scientific article; zbMATH DE number 5788670 |
Statements
20 September 2010
0 references
visibly pushdown languages
0 references
visibly pushdown automata
0 references
0.9947245121002196
0 references
0.831019401550293
0 references
0.7862918972969055
0 references
0.7838621735572815
0 references
0.778995931148529
0 references
