Pages that link to "Item:Q3503645"
From MaRDI portal
The following pages link to Lambek Grammars with One Division Are Decidable in Polynomial Time (Q3503645):
Displaying 5 items.
- Product-free Lambek calculus is NP-complete (Q408532) (← links)
- On translating Lambek grammars with one division into context-free grammars (Q511445) (← links)
- Undecidability of the Lambek Calculus with a Relevant Modality (Q2835058) (← links)
- Product-Free Lambek Calculus Is NP-Complete (Q3605542) (← links)
- On Lambek’s Restriction in the Presence of Exponential Modalities (Q5283424) (← links)
