An Iteration Theorem for Simple Precedence Languages

DOI10.1145/2157.322408MaRDI QIDQ3765258zbMATH OpenOpenAlexFDO

Authors Yael Krevner, Amiram Yehudai

Publication date 1983

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2157.322408

zbMATH Keywords

pumping lemmaiteration theoremsimple precedence languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 4047163
• On the descriptive power of simple precedence grammars
• Some properties of iterated languages
• Some properties of precedence languages
• scientific article; zbMATH DE number 1870548

Cited in

(4)

• Epsilon weak precedence grammars and languages
• On the descriptive power of simple precedence grammars
• Some properties of precedence languages
• scientific article; zbMATH DE number 4085054 (Why is no real title available?)

This page was built for publication: An Iteration Theorem for Simple Precedence Languages

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