Theory of Computing Systems

, Volume 46, Issue 4, pp 662–672 | Cite as

Unidirectional Lambek Grammars in Polynomial Time

Article

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.

Keywords

Lambek calculus Unidirectional Lambek grammars Complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aarts, E., Trautwein, K.: Non-associative Lambek categorial grammar in polynomial time. Math. Log. Q. 41, 476–484 (1995) MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Buszkowski, W.: The equivalence of unidirectional Lambek categorial grammars and context-free grammars. Z. Math. Log. Grundl. Math. 31(4), 369–384 (1985) MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    de Groote, P.: The non-associative Lambek calculus with product in polynomial time. In: Murray, N.V. (ed.) Automated Reasoning with Analytic Tableaux and Related Methods, pp. 128–139. Springer, Berlin (1999) CrossRefGoogle Scholar
  4. 4.
    Lambek, J.: The mathematics of sentence structure. Am. Math. Mon. 65(3), 154–170 (1958) MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Lambek, J.: On the calculus of syntactic types. In: Jakobson, R. (ed.) Structure of Language and Its Mathematical Aspects. Proc. Symposia Appl. Math., vol. 12, pp. 166–178. Amer. Math. Soc., Providence (1961) Google Scholar
  6. 6.
    Pentus, M.: Lambek calculus is NP-complete. Theor. Comput. Sci. 357(1–3), 186–201 (2006) MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Pentus, M.: Lambek grammars are context free. In: Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science, pp. 429–433 (1993) Google Scholar
  8. 8.
    Savateev, Y.: The derivability problem for Lambek calculus with one division. Technical report, Utrecht University, Artificial Intelligence Preprint Series, no. 56 (2006) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of Mathematical Logic and Theory of AlgorithmsMoscow State UniversityMoscowRussia

Personalised recommendations