The Boolean closure of linear context-free languages

被引：0
|
作者：
Kutrib, Martin [1 ]
Malcher, Andreas [2 ]
Wotschke, Detlef [2 ]
机构：
[1] Institut für Informatik, Universität Giessen, Giessen, Germany
[2] Institut für Informatik, Johann Wolfgang Goethe-Universität Frankfurt, Frankfurt am Main, Germany
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2004年 / 3340卷
关键词：
Boolean algebra;
D O I：
10.1007/978-3-540-30550-7_24
中图分类号：
学科分类号：
摘要：
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. © Springer-Verlag Berlin Heidelberg 2004.
引用
收藏
页码：284 / 295
相关论文
共 50 条
12345