Powerful and NP-complete: hypergraph Lambek grammars

DOI10.1007/978-3-030-78946-6_6zbMath1492.68073OpenAlexW3173814003MaRDI QIDQ2117261

Tikhon Pshenitsyn

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78946-6_6

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Hypergraph Lambek grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Graph transformation. 13th international conference, ICGT 2020, held as part of STAF 2020, Bergen, Norway, June 25--26, 2020. Proceedings
• Second-order abstract categorial grammars as hyperedge replacement grammars
• Multimodal linguistic inference
• Lambek calculus is NP-complete
• The Mathematics of Sentence Structure
• Product-free Lambek calculus and context-free grammars

This page was built for publication: Powerful and NP-complete: hypergraph Lambek grammars