Rediscovering pushdown machines

DOI10.1007/3-540-58131-6_60MaRDI QIDQ6183617zbMATH OpenOpenAlexFDO

Authors Kai Salomaa, D. Wood, Sheng Yu

Publication date 29 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58131-6_60

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Pumping and pushdown machines
• Look-ahead on pushdowns
• scientific article; zbMATH DE number 2150277
• Properties of deterministic top down grammars
• A note on limited pushdown alphabets in stateless deterministic pushdown automata

Cites work

• scientific article; zbMATH DE number 3646311 (Why is no real title available?)
• scientific article; zbMATH DE number 3648125 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• On the inherent ambiguity of simple tuple languages
• Properties of deterministic top-down grammars
• Pumping and pushdown machines
• The structure generating function and entropy of tuple languages
• Two iteration theorems for the LL(k) languages

This page was built for publication: Rediscovering pushdown machines

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