Authors: Yury Savateev
Publish Date: 2009/03/28
Volume: 46, Issue: 4, Pages: 662-672
Abstract
Lambek grammars provide a useful tool for studying formal and natural languages The generative power of unidirectional Lambek grammars equals that of contextfree 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
Keywords: