Unidirectional Lambek Grammars in Polynomial Time

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… (More)
DOI: 10.1007/s00224-009-9208-4

3 Figures and Tables

Topics

  • Presentations referencing similar topics