共 50 条
- [26] k-valued non-associative Lambek grammars (Without product) form a strict hierarchy of languages [J]. LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS, PROCEEDINGS, 2005, 3492 : 1 - 17
- [28] Rigid grammars in the associative-commutative Lambek calculus are not learnable [J]. EACL 2003: 10TH CONFERENCE OF THE EUROPEAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE, 2003, : 75 - 82
- [30] Lambek-Calculus with general elimination rules and continuation semantics [J]. LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS, PROCEEDINGS, 2005, 3492 : 101 - 113