The Boolean closure of linear context-free languages
type: Item
instance of: scholarly article
title: The Boolean closure of linear context-free languages
zbMATH Open document ID: 1144.68035
author: Martin Kutrib
author: Andreas Malcher
author: Detlef Wotschke
published in: Acta Informatica
publication date: 2008-06-17T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5288697
zbMATH Keywords: Boolean operations
zbMATH Keywords: non-unary languages
MaRDI profile type: Publication
full work available at URL: s00236-007-0068-6
OpenAlex ID: W1982735795
cites work: Reversal-bounded multipushdown machines
cites work: UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
cites work: On time computability of functions in one-way cellular automata
cites work: One-way bounded cellular automata
cites work: Q5576254
cites work: Deterministic context free languages
cites work: An efficient recognizer for the Boolean closure of context-free languages
cites work: Characterizations and computational complexity of systolic trellis automata
cites work: Parallel parsing on a one-way linear array of finite-state machines
cites work: On strongly context-free languages
cites work: An infinite hierarchy of intersections of context-free languages
cites work: Q4412133
cites work: Boolean grammars
cites work: On Context-Free Languages
cites work: Q5678435
cites work: Real-time language recognition by one-dimensional cellular automata
cites work: On real time one-way cellular array
cites work: Q3214431
cites work: Degree-languages: A new concept of acceptance
cites work: Nondeterminism and Boolean operations in pda's
DOI: 10.1007/S00236-007-0068-6
Recommended article: Developments in Language Theory
Recommended article: Q3601403
Recommended article: The Boolean Closure of Growing Context-Sensitive Languages
Recommended article: An efficient recognizer for the Boolean closure of context-free languages
Recommended article: On the closure properties of linear conjunctive languages.
Recommended article: Boolean kernels of context-free languages
Recommended article: Closure properties of linear context-free tree languages with an application to optimality theory
Recommended article: Q3165949
Recommended article: On closure properties of \(\mathcal{L}\)-valued linear languages
Recommended article: Finite turns and the regular closure of linear context-free languages
description: scientific article; zbMATH DE number 5288697