Formal languages
Parallel parsing on a one-way linear array of finite-state machines
Theoretical Computer Science
On real time one-way cellular array
Theoretical Computer Science
Journal of the ACM (JACM)
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
A characterization of boolean closures of families of languages
1. Fachtagung über Automatentheorie und Formale Sprachen
The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages
Gesellschaft für Informatik e.V., 3. Jahrestagung
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Cellular automata and formal languages
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Real-time language recognition by one-dimensional cellular automata
Journal of Computer and System Sciences
Reversal-bounded multipushdown machines
Journal of Computer and System Sciences
Automaton representation of linear conjunctive languages
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Some non-semi-decidability problems for linear and deterministic context-free languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
The boolean closure of growing context-sensitive languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Hi-index | 0.00 |
Closures of linear context-free languages under Boolean operations are investigated. The intersection closure and the complementation closure are incomparable. By closing these closures under further Boolean operations we obtain several new language families. The hierarchy obtained by such closures of closures is proper up to level four, where it collapses to the Boolean closure which, in turn, is incomparable with several closures of the family of context-free languages. The Boolean closure of the linear context-free languages is properly contained in the Boolean closure of the context-free languages. A characterization of a class of non-unary languages that cannot be expressed as a Boolean formula over the linear context-free languages is presented.