Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

LICS
1993
IEEE

favoriteEmaildiscussreport

111views Automated Reasoning» more LICS 1993»

Lambek Grammars Are Context Free

13 years 8 months ago

Lambek Grammars Are Context Free

Download lpcs.math.msu.su

In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are context free.

Mati Pentus

Real-time Traffic

Automated Reasoning | Chomsky Conjecture | Lambek Calculus | LICS 1993 |

claim paper

Related Content

» Nonassociative Lambek Calculus with Additives and ContextFree Languages

» Lambek Grammars Based on Pregroups

» Strongly Regular Grammars and Regular Approximation of ContextFree Languages

» Exploring Feature Agreement in French with Parallel Pregroup Computations

» Learning Context Free Grammars with the Syntactic Concept Lattice

» Continuation semantics for the LambekGrishin calculus

» Variational Inference for Adaptor Grammars

» Estimating Compact Yet Rich Tree Insertion Grammars

» The Pumping Lemma for WellNested Multiple ContextFree Languages

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1993
Where	LICS
Authors	Mati Pentus

Comments (0)