A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages
type: Item
instance of: scholarly article
title: A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages
zbMATH Open document ID: 0507.68044
DOI: 10.1016/0304-3975(88)90008-4
published in: Theoretical Computer Science
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68N20
zbMATH DE Number: 3800945
zbMATH Keywords: LL-regular language
zbMATH Keywords: LR-regular language
zbMATH Keywords: Post's correspondence problem
zbMATH Keywords: relative decision problems
author: Stephan Heilbrunner
MaRDI profile type: Publication
full work available at URL: 0304-3975(88)90008-4
OpenAlex ID: W2073105126
cites work: Optimization of LR(k) parsers
cites work: Two iteration theorems for the LL(k) languages
cites work: LR-regular grammars - an extension of LR(k) grammars
cites work: Q4198075
cites work: On the Parsing of Deterministic Languages
cites work: Q5592246
cites work: Q4134979
cites work: Q4140366
cites work: Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems''
cites work: On the translation of languages from left to right
cites work: Q4124327
cites work: On LL-regular grammars
cites work: Q5573961
cites work: Properties of deterministic top-down grammars
cites work: Noncanonical Extensions of Bottom-Up Parsing Techniques
description: scientific article; zbMATH DE number 3800945