Unidirectional Lambek Grammars in Polynomial Time

Authors:
Yury Savateev
Affiliations:
Moscow State University, Department of Mathematical Logic and Theory of Algorithms, Moscow, Russia
Venue:
Theory of Computing Systems - Special Issue: Symposium on Computer Science; Guest Editors: Sergei Artemov, Volker Diekert and Alexander Razborov
Year:
2010

Citing 0
Cited 3

A savateev-style parsing algorithm for pregroup grammars

FG'09 Proceedings of the 14th international conference on Formal grammar
Pregroup grammars with letter promotions

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Pregroup grammars with letter promotions: Complexity and context-freeness

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lambek grammars provide a useful tool for studying formal and natural languages. The generative power of unidirectional Lambek grammars equals that of context-free grammars. However, no feasible algorithm was known for deciding membership in the corresponding formal languages. In this paper we present a polynomial algorithm for deciding whether a given word belongs to a language generated by a given unidirectional Lambek grammar.