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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts, E., Trautwein, K.: Non-associative Lambek categorial grammar in polynomial time. Mathematical Logic Quarterly 41, 476–484 (1995)
Buszkowski, W.: The equivalence of unidirectional Lambek categorial grammars and context-free grammars. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 31(4), 369–384 (1985)
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, Heidelberg (1999)
Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly 65(3), 154–170 (1958)
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, RI (1961)
Pentus, M.: Lambek calculus is NP-complete. Theoretical Computer Science 357(1–3), 186–201 (2006)
Pentus, M.: Lambek grammars are context free. In: Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science, pp. 429–433 (1993)
Savateev, Y.: The derivability problem for lambek calculus with one division. Technical report, Utrecht University, Artificial Intelligence Preprint Series no. 56 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Savateev, Y. (2008). Lambek Grammars with One Division Are Decidable in Polynomial Time. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds) Computer Science – Theory and Applications. CSR 2008. Lecture Notes in Computer Science, vol 5010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79709-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-79709-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79708-1
Online ISBN: 978-3-540-79709-8
eBook Packages: Computer ScienceComputer Science (R0)