Lambek Grammars with One Division Are Decidable in Polynomial Time
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.
KeywordsPolynomial Time Induction Assumption Algorithm Description Angle Bracket Primitive Type
Unable to display preview. Download preview PDF.
- 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, RI (1961)Google Scholar
- 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.Savateev, Y.: The derivability problem for lambek calculus with one division. Technical report, Utrecht University, Artificial Intelligence Preprint Series no. 56 (2006)Google Scholar