Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations (Q1143812)
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: Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations |
scientific article; zbMATH DE number 3690737
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations |
scientific article; zbMATH DE number 3690737 |
Statements
Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations (English)
0 references
1980
0 references
deterministic pushdown automata computations
0 references
largest running times
0 references
highest inefficiency
0 references
maximal number of epsilon-moves
0 references
