Pages that link to "Item:Q929298"
From MaRDI portal
The following pages link to The Boolean closure of linear context-free languages (Q929298):
Displaying 8 items.
- The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731) (← links)
- Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- A note on the class of languages generated by F-systems over regular languages (Q2094358) (← links)
- Boolean kernels of context-free languages (Q2117675) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- Kernels of Sub-classes of Context-Free Languages (Q3297763) (← links)
- The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata (Q5200083) (← links)
