@InProceedings{przybylko_et_al:LIPIcs.MFCS.2016.78, author = {Przybylko, Marcin and Skrzypczak, Michal}, title = {{On the Complexity of Branching Games with Regular Conditions}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {78:1--78:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.78}, URN = {urn:nbn:de:0030-drops-64865}, doi = {10.4230/LIPIcs.MFCS.2016.78}, annote = {Keywords: stochastic games, meta-parity games, infinite trees, regular languages, parity automata} }