On translating context-free grammars into Lambek grammars

DOI10.1134/S0081543815060061zbMath1333.68171OpenAlexW2278498569MaRDI QIDQ902051

Stepan Kuznetsov

Publication date: 7 January 2016

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543815060061

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic of natural languages (03B65)

Related Items (2)

On translating Lambek grammars with one division into context-free grammars ⋮ Undecidability of the Lambek Calculus with a Relevant Modality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lambek grammars with one division and one primitive type
• The Mathematics of Sentence Structure
• Product-Free Lambek Calculus Is NP-Complete
• The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars
• The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Three models for the description of language

This page was built for publication: On translating context-free grammars into Lambek grammars