Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars

DOI10.1007/978-3-642-35722-0_23zbMath1437.68106OpenAlexW3564880MaRDI QIDQ3455855

Alexey Sorokin

Publication date: 11 December 2015

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35722-0_23

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic of natural languages (03B65) Grammars and rewriting systems (68Q42)

Related Items (3)

Ogden Property for Linear Displacement Context-Free Grammars ⋮ Extended Lambek Calculi and First-Order Linear Logic ⋮ Models for the Displacement Calculus

Cites Work

• Unnamed Item
• On multiple context-free grammars
• On parsing coupled-context-free languages
• The displacement calculus
• The Mathematics of Sentence Structure
• The Copying Power of Well-Nested Multiple Context-Free Grammars
• The Pumping Lemma for Well-Nested Multiple Context-Free Languages
• The equivalence of four extensions of context-free grammars
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

This page was built for publication: Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars