Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations

DOI10.1016/S0020-0190(80)90079-4zbMath0442.68083OpenAlexW2114022072MaRDI QIDQ1143812

Paul M. B. Vitányi

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(80)90079-4

zbMATH Keywords

deterministic pushdown automata computationshighest inefficiencylargest running timesmaximal number of epsilon-moves

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Cites Work

• Unnamed Item
• An improved bound for detecting looping configurations in deterministic PDA's
• Optimization of LR(k) parsers
• Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
• Deterministic context free languages
• On context-free languages and push-down automata

This page was built for publication: Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations