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

DOI10.1016/0020-0190(74)90042-8MaRDI QIDQ1214756zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Deterministic context free languages
• On context-free languages and push-down automata
• On the translation of languages from left to right
• Optimization of LR(k) parsers
• Strict deterministic grammars

Cited in

(1)

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

This page was built for publication: An improved bound for detecting looping configurations in deterministic PDA's

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1214756)