Pages that link to "Item:Q3075534"
From MaRDI portal
The following pages link to Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534):
Displaying 7 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Toward a theory of input-driven locally parsable languages (Q728273) (← links)
- Recognition of poly-slender context-free languages by trellis automata (Q2401759) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Shrinking one-way cellular automata (Q6191203) (← links)
