Handbook of formal languages, vol. 3
Journal of the ACM (JACM)
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Global Index Grammars and Descriptive Power
Journal of Logic, Language and Information
New developments in parsing technology
Journal of Computer and System Sciences
Symmetries in natural language syntax and semantics: the Lambek-Grishin calculus
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Relational semantics for the Lambek-Grishin calculus
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
The product-free Lambek-Grishin calculus is NP-complete
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
The Lambek-Grishin calculus is NP-Complete
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
| Hi-index | 0.00 |
The Lambek-Grishin calculus LG is a categorial type logic obtained by adding a family of connectives {⊕,???,???} dual to the family {⊗, /, \}, and adding interaction postulates between the two families of connectives thus obtained. In this paper, we prove a new lower bound on the generative capacity of LG, namely the class of languages that are the intersection of a context-free language and the permutation closure of a context-free language. This implies that LG recognizes languages like the MIX language, e.g. the permutation closure of {anbncn | n ∈ N}, and {anbncndnen | n ∈ N}, which can not be recognized by tree adjoining grammars.