The Boolean closure of linear context-free languages
From MaRDI portal
Publication:929298
DOI10.1007/s00236-007-0068-6zbMath1144.68035OpenAlexW1982735795MaRDI QIDQ929298
Andreas Malcher, Detlef Wotschke, Martin Kutrib
Publication date: 17 June 2008
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-007-0068-6
Related Items (7)
Boolean language operations on nondeterministic automata with a pushdown of constant height ⋮ The size-cost of Boolean operations on constant height deterministic pushdown automata ⋮ Kernels of Sub-classes of Context-Free Languages ⋮ Two double-exponential gaps for automata with a limited pushdown ⋮ The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata ⋮ A note on the class of languages generated by F-systems over regular languages ⋮ Boolean kernels of context-free languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On real time one-way cellular array
- Characterizations and computational complexity of systolic trellis automata
- An efficient recognizer for the Boolean closure of context-free languages
- On time computability of functions in one-way cellular automata
- Parallel parsing on a one-way linear array of finite-state machines
- Reversal-bounded multipushdown machines
- Degree-languages: A new concept of acceptance
- Nondeterminism and Boolean operations in pda's
- On strongly context-free languages
- Boolean grammars
- Real-time language recognition by one-dimensional cellular automata
- One-way bounded cellular automata
- UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
- Deterministic context free languages
- On Context-Free Languages
- An infinite hierarchy of intersections of context-free languages
This page was built for publication: The Boolean closure of linear context-free languages
