Pages that link to "Item:Q987373"
From MaRDI portal
The following pages link to Unidirectional Lambek grammars in polynomial time (Q987373):
Displaying 9 items.
- On translating Lambek grammars with one division into context-free grammars (Q511445) (← links)
- Pregroup grammars with letter promotions: complexity and context-freeness (Q1757847) (← links)
- A direct complement construction for \(LR\)(1) grammars (Q1901717) (← links)
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities (Q2035845) (← links)
- Kleene star, subexponentials without contraction, and infinite computations (Q2234420) (← links)
- Lambek Grammars with One Division Are Decidable in Polynomial Time (Q3503645) (← links)
- An analysis of Lambek's production machines (Q4385678) (← links)
- A polynomial-time algorithm for the Lambek calculus with brackets of bounded order (Q5111318) (← links)
- The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars (Q5184422) (← links)