Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Theory Comput Syst

Search In Journal Title:

Abbravation: Theory of Computing Systems

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1002/cjoc.19980160212

Search In DOI:

ISSN

1433-0490

Search In ISSN:
Search In Title Of Papers:

Unidirectional Lambek Grammars in Polynomial Time

Authors: Yury Savateev
Publish Date: 2009/03/28
Volume: 46, Issue: 4, Pages: 662-672
PDF Link

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:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:


Search Result: