Sciweavers

179 search results - page 1 / 36
» Lambek Grammars Are Context Free
Sort
View
LICS
1993
IEEE
14 years 2 months ago
Lambek Grammars Are Context Free
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are context free.
Mati Pentus
BIRTHDAY
2009
Springer
14 years 5 months ago
Nonassociative Lambek Calculus with Additives and Context-Free Languages
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
Wojciech Buszkowski, Maciej Farulewski
LACL
2001
Springer
14 years 3 months ago
Lambek Grammars Based on Pregroups
Lambek [13] introduces pregroups as a new framework for syntactic structure. In this paper we prove some new theorems on pregroups and study grammars based on the calculus of free...
Wojciech Buszkowski
DLT
2009
13 years 8 months ago
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
Abstract. We consider algorithms for approximating context
Ömer Egecioglu
JOLLI
2010
84views more  JOLLI 2010»
13 years 9 months ago
Exploring Feature Agreement in French with Parallel Pregroup Computations
One way of coping with agreement of features in French is to perform two parallel computations, one in the free pregroup of syntactic types, the other in that of feature types. Tec...
Joachim Lambek