Minimization of visibly pushdown automata is NP-complete (Q5216306)
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: Minimization of visibly pushdown automata is NP-complete |
scientific article; zbMATH DE number 7168150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimization of visibly pushdown automata is NP-complete |
scientific article; zbMATH DE number 7168150 |
Statements
17 February 2020
0 references
visibly pushdown automata
0 references
minimization
0 references
0.8330908417701721
0 references
0.8022726774215698
0 references
0.7780137658119202
0 references
0.7745103240013123
0 references
0.7726406455039978
0 references
