On permutative grammars generating context-free languages

Authors:
Erkki Mäkinen
Affiliations:
Univ. of Tampere, Tampere, Finland
Venue:
BIT
Year:
1985

Citing 0
Cited 2

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

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Permutation Languages in Formal Linguistics

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract