Uniform recognition for acyclic context-sensitive grammars is NP-complete

Authors:
Erik Aarts
Affiliations:
Research Institute for Language & Speech, Utrecht, The Netherlands
Venue:
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Year:
1992

Citing 7
Cited 0

On permutative grammars generating context-free languages

BIT
Membership for growing context-sensitive grammars is polynomial

Journal of Computer and System Sciences
Context-Limited Grammars

Journal of the ACM (JACM)
An efficient context-free parsing algorithm

Communications of the ACM
Elements of the Theory of Computation

Elements of the Theory of Computation
Computational Complexity and Natural Language

Computational Complexity and Natural Language
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

Context-sensitive grammars in which each rule is of the form αZβ → αγβ are acyclic if the associated context-free grammar with the rules Z → γ is acyclic. The problem whether an input string is in the language generated by an acyclic context-sensitive grammar is NP-complete.