@InProceedings{glasser_et_al:LIPIcs.STACS.2008.1355,
author = {Glasser, Christian and Schmitz, Heinz and Selivanov, Victor},
title = {{Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages}},
booktitle = {25th International Symposium on Theoretical Aspects of Computer Science},
pages = {337--348},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-06-4},
ISSN = {1868-8969},
year = {2008},
volume = {1},
editor = {Albers, Susanne and Weil, Pascal},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1355},
URN = {urn:nbn:de:0030-drops-13554},
doi = {10.4230/LIPIcs.STACS.2008.1355},
annote = {Keywords: Automata and formal languages, computational complexity, dot-depth hierarchy, Boolean hierarchy, decidability, efficient algorithms}
}