2002•Unpublished venueRequires access
Lambek grammars are context free
Мati Pentus
Open publisher page 182 citations
Abstract
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are con-text free.
Мati Pentus
Abstract
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are con-text free.
OpenAlex reports 182 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are con-text free.
Key concepts: Categorial grammar, Tree-adjoining grammar, Context-sensitive grammar, Indexed grammar, Combinatory categorial grammar, L-attributed grammar, Phrase structure grammar, Context-free grammar