On translating Lambek grammars with one division into context-free grammars
From MaRDI portal
Publication:511445
DOI10.1134/S0081543816060080zbMath1359.68153MaRDI QIDQ511445
Publication date: 15 February 2017
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0081543816060080
Related Items
Unnamed Item, Subexponentials in non-commutative linear logic, The multiplicative-additive Lambek calculus with subexponential and bracket modalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Product-free Lambek calculus is NP-complete
- On translating context-free grammars into Lambek grammars
- The atomic theory of division of semiring ideals
- General context-free recognition in less than cubic time
- The Lambek calculus enriched with additional connectives
- On the generative capacity of multi-modal categorial grammars
- Multimodal linguistic inference
- Circular proofs for the Gödel-Löb provability logic
- Lambek calculus is NP-complete
- Recognition of derivability for the Lambek calculus with one division
- Circuit Complexity Meets Ontology-Based Data Access
- The Mathematics of Sentence Structure
- Lambek Grammars with One Division Are Decidable in Polynomial Time
- Nested sequents for provability logic GLP: FIG. 1.
- The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars
- The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars
- Three models for the description of language
- On context-free languages and push-down automata
