The language intersection problem for non-recursive context-free grammars☆
Under an Elsevier user license
open archive
Keywords
Formal languages
Context-free grammars
Computational complexity
Parsing algorithms
Cited by (0)
- ☆
We thank Harry B. Hunt III for helpful correspondence. We are indebted to an anonymous referee for proposals leading to most of the content of Section 3.
- 1
Supported by the PIONIER Project Algorithms for Linguistic Processing, funded by NWO (Dutch Organization for Scientific Research).
- 2
Partially supported by MIUR under project PRIN No. 2003091149_005.
Copyright © 2004 Elsevier Inc. All rights reserved.