@inproceedings{BojanczykPlace:ICALP:2012,
    Abstract = {In this paper, we study boolean (not necessarily positive) combinations of open sets. In other words, we study positive boolean combinations of safety and reachability conditions. We give an algorithm, which inputs a regular language of infinite trees, and decides if the language is a boolean combination of open sets.},
    Address = {Berlin, Heidelberg},
    Author = {Boja\'{n}czyk, Miko{\l}{}aj and Place, Thomas},
    BookTitle = {Proc. of ICALP'12},
    File = {Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets - Bojańczyk-Place2012\_Chapter\_RegularLanguagesOfInfiniteTree - a - g.pdf},
    ISBN = {9783642315848},
    Location = {Warwick, UK},
    Pages = {104---115},
    Publisher = {Springer-Verlag},
    Series = {ICALP'12},
    Title = {Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets},
    URL = {https://doi.org/10.1007/978-3-642-31585-5\_13},
    Year = {2012},
    bdsk-url-1 = {https://doi.org/10.1007/978-3-642-31585-5\_13},
    date-added = {2021-02-11 18:45:01 +0100},
    date-modified = {2021-02-11 18:45:19 +0100},
    numpages = {12},
    doi = {10.1007/978-3-642-31585-5_13}
}

@inproceedings{BojanczykPlace:ICALP:2012, Abstract = {In this paper, we study boolean (not necessarily positive) combinations of open sets. In other words, we study positive boolean combinations of safety and reachability conditions. We give an algorithm, which inputs a regular language of infinite trees, and decides if the language is a boolean combination of open sets.}, Address = {Berlin, Heidelberg}, Author = {Boja\'{n}czyk, Miko{\l}{}aj and Place, Thomas}, BookTitle = {Proc. of ICALP'12}, File = {Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets - Bojańczyk-Place2012_Chapter_RegularLanguagesOfInfiniteTree - a - g.pdf}, ISBN = {9783642315848}, Location = {Warwick, UK}, Pages = {104---115}, Publisher = {Springer-Verlag}, Series = {ICALP'12}, Title = {Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets}, URL = {https://doi.org/10.1007/978-3-642-31585-5_13}, Year = {2012}, bdsk-url-1 = {https://doi.org/10.1007/978-3-642-31585-5_13}, date-added = {2021-02-11 18:45:01 +0100}, date-modified = {2021-02-11 18:45:19 +0100}, numpages = {12}, doi = {10.1007/978-3-642-31585-5_13} }