Abstract
A metatheorem will be proved for decision problems which can be represented by pairs of simple grammars. Examples are given in support of the claim that the metatheorem has a wide range of applications. In particular, some relative decision problems concerning LR(k), LL-regular, and LR-regular grammars and languages are shown to be undecidable. In addition, iteration theorems are derived which allow the proof that certain languages are no: LL-regular of LR-regular.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
