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

Authors:
Mark-Jan Nederhof;Giorgio Satta
Affiliations:
Faculty of Arts, University of Groningen, P.O. Box 716, NL-9700 AS Groningen, The Netherlands;Department of Information Engineering, University of Padua via Gradenigo, 6/A, 1-35131 Padua, Italy
Venue:
Information and Computation
Year:
2004

Citing 14
Cited 5

Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes

Journal of the ACM (JACM)
Parsing theory. Vol. 1: languages and parsing

Parsing theory. Vol. 1: languages and parsing
Efficient parallel algorithms

Efficient parallel algorithms
Nondeterministic space is closed under complementation

SIAM Journal on Computing
On the Decidability of Grammar Problems

Journal of the ACM (JACM)
Elements of the Theory of Computation

Elements of the Theory of Computation
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory

Introduction to Formal Language Theory
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
On the complexity analysis of static analyses

Journal of the ACM (JACM)
Preserving Ambiguities in Generation via Automata Intersection

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Path systems and language recognition

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Forest-based statistical sentence generation

NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Parsing non-recursive context-free grammars

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics

Querying business processes

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Querying business processes with BP-QL

Information Systems
IDL-expressions: a formalism for representing and parsing finite languages in natural language processing

Journal of Artificial Intelligence Research
Detecting conflicts among declarative UI extensions

Proceedings of the 8th symposium on Dynamic languages
A global model for concept-to-text generation

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that, given as input two context-free grammars, deciding non-emptiness of intersection of the two generated languages is PSPACE-complete if at least one grammar is non-recursive. The problem remains PSPACE-complete when both grammars are non-recursive and deterministic. Also investigated are generalizations of the problem to several context-free grammars, of which a certain number are non-recursive.