On the Generative Power of Discontinuous Lambek Calculus
We prove that the class of languages which are generated by discontinuous Lambek grammars and do not contain the empty word is closed under intersection with regular languages. The size of the grammar for the intersection is linear with respect to the size of the initial discontinuous Lambek grammar.
Unable to display preview. Download preview PDF.
- 1.Aho, A., Ullman, J.: The theory of parsing, translation, and compiling. Prentice-Hall, Inc. (1972)Google Scholar
- 3.Kanazawa, M., Salvati, S.: MIX is not a tree-adjoining language. In: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, pp. 666–674 (2012)Google Scholar
- 6.Morrill, G., Valentín, O.: On calculus of displacement. In: Proceedings of the 10th International Workshop on Tree Adjoining Grammars and Related Formalisms, pp. 45–52 (2010)Google Scholar
- 8.Pentus, M.: Lambek grammars are context-free. In: Logic in Computer Science, Proceedings of the LICS 1993, pp. 429–433 (1993)Google Scholar