Descriptional complexity of unambiguous input-driven pushdown automata (Q484313)
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: Descriptional complexity of unambiguous input-driven pushdown automata |
scientific article; zbMATH DE number 6383893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Descriptional complexity of unambiguous input-driven pushdown automata |
scientific article; zbMATH DE number 6383893 |
Statements
Descriptional complexity of unambiguous input-driven pushdown automata (English)
0 references
6 January 2015
0 references
nondeterminism
0 references
unambiguity
0 references
input-driven pushdown automata
0 references
visibly pushdown automata
0 references
nested word automata
0 references
descriptional complexity
0 references
0 references
0 references
0 references
0 references
0.9308838248252868
0 references
0.8880881071090698
0 references
0.8669666647911072
0 references
0.8290490508079529
0 references
0.8230085968971252
0 references
