The language intersection problem for non-recursive context-free grammars

DOI10.1016/J.IC.2004.03.004zbMath1069.68069OpenAlexW2024730357MaRDI QIDQ596298

Mark-Jan Nederhof, Giorgio Satta

Publication date: 10 August 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.03.004

zbMATH Keywords

Computational complexityFormal languagesContext-free grammarsParsing algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• On the equivalence, containment, and covering problems for the regular and context-free languages
• Optimization of LR(k) parsers
• On the complexity analysis of static analyses
• Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes
• Nondeterministic Space is Closed under Complementation
• On the Decidability of Grammar Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The language intersection problem for non-recursive context-free grammars