An improved bound for detecting looping configurations in deterministic PDA's

DOI10.1016/0020-0190(74)90042-8zbMath0298.68040OpenAlexW2040857571MaRDI QIDQ1214756

S. Singh

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1016/0020-0190(74)90042-8

zbMATH Keywords

deterministic push-down automatalooping configuration

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

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

Cites Work

• Strict deterministic grammars
• Optimization of LR(k) parsers
• Deterministic context free languages
• On the translation of languages from left to right
• On context-free languages and push-down automata
• Unnamed Item