A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages

DOI10.1016/0304-3975(88)90008-4zbMath0507.68044OpenAlexW2073105126MaRDI QIDQ1837536

Stephan Heilbrunner

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90008-4

zbMATH Keywords

Post's correspondence problemLL-regular languageLR-regular languagerelative decision problems

Mathematics Subject Classification ID

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

Related Items (1)

Left-to-right regular languages and two-way restarting automata

Cites Work

• Two iteration theorems for the LL(k) languages
• On LL-regular grammars
• LR-regular grammars - an extension of LR(k) grammars
• Optimization of LR(k) parsers
• On the Parsing of Deterministic Languages
• Noncanonical Extensions of Bottom-Up Parsing Techniques
• Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems
• Properties of deterministic top-down grammars
• On the translation of languages from left to right
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages