Pages that link to "Item:Q929298"
From MaRDI portal
The following pages link to The Boolean closure of linear context-free languages (Q929298):
Displaying 15 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)
- An efficient recognizer for the Boolean closure of context-free languages (Q802880) (← links)
- On the closure properties of linear conjunctive languages. (Q1874415) (← 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)
- On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
- Closure properties of linear context-free tree languages with an application to optimality theory (Q2368942) (← links)
- Finite turns and the regular closure of linear context-free languages (Q2384399) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- On Boolean closed full trios and rational Kripke frames. (Q2965514) (← 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)
- Developments in Language Theory (Q5711962) (← links)
