k\(+1\) heads are better than k for PDAs (Q1109579)
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: k\(+1\) heads are better than k for PDAs |
scientific article; zbMATH DE number 4070370
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | k\(+1\) heads are better than k for PDAs |
scientific article; zbMATH DE number 4070370 |
Statements
k\(+1\) heads are better than k for PDAs (English)
0 references
1988
0 references
deterministic pushdown automata
0 references
0 references
