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

DOI10.1016/0304-3975(88)90008-4zbMATH Open0507.68044OpenAlexW2073105126MaRDI QIDQ1837536FDOQ1837536

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

Cites Work

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

Cited In (1)

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

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

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