The covering problem for linear context-free grammars

DOI10.1016/0304-3975(76)90088-8zbMath0343.68037OpenAlexW2010866826WikidataQ127846323 ScholiaQ127846323MaRDI QIDQ1232301

Harry B. III Hunt, Daniel J. Rosenkrantz, Thomas G. Szymanski

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90088-8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

A survey of normal form covers for context-free grammars, On homomorphic images of left szilard languages, From left-regular to Greibach normal form grammars, On derivation preservation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the equivalence, containment, and covering problems for the regular and context-free languages
• Structural equivalence of context-free grammars
• Relationships between nondeterministic and deterministic tape complexities
• Optimization of LR(k) parsers
• Parenthesis Grammars
• A characterization of parenthesis languages
• On the Covering and Reduction Problems for Context-Free Grammars