@inproceedings(amarilliProvenance, author = {Antoine Amarilli and Pierre Bourhis and Pierre Senellart}, year = {2015}, title = {Provenance Circuits for Trees and Treelike Instances}, booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {II}}, pages = {56--68}, doi = {10.1007/978-3-662-47666-6\_5}, ) @inproceedings(amarilliCQsOnProbabilisticGraphs, author = {Antoine Amarilli and Mika{\"{e}}l Monet and Pierre Senellart}, year = {2017}, title = {Conjunctive Queries on Probabilistic Graphs: Combined Complexity}, booktitle = {Proceedings of the 36th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles of Database Systems, {PODS} 2017, Chicago, IL, USA, May 14-19, 2017}, pages = {217--232}, doi = {10.1145/3034786.3056121}, ) @article(bjorklundCQscontainment, author = {Bj{\o}rklund, Henrik and Wim Martens and Thomas Schwentick}, year = {2011}, title = {Conjunctive query containment over trees}, journal = {Journal of Computer and System Sciences}, volume = {77}, number = {3}, pages = {450 -- 472}, doi = {10.1016/j.jcss.2010.04.005}, note = {Database Theory}, ) @article(chatterjeeStochasticRegular, author = {Krishnendu Chatterjee and Thomas~A. Henzinger}, year = {2012}, title = {A survey of stochastic {$\omega$}-regular games}, journal = {J. Comput. Syst. Sci.}, volume = {78}, number = {2}, pages = {394--413}, doi = {10.1016/j.jcss.2011.05.002}, ) @inproceedings(chenStochasticBranchingProcesses, author = {Taolue Chen and Klaus Dr{\"{a}}ger and Stefan Kiefer}, year = {2012}, title = {Model Checking Stochastic Branching Processes}, booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings}, pages = {271--282}, doi = {10.1007/978-3-642-32589-2\_26}, ) @incollection(galeGames, author = {David Gale and Frank~M. Stewart}, year = {1953}, title = {Infinite games with perfect information}, booktitle = {Contributions to the theory of games}, series = {Annals of Mathematics Studies, no. 28}, volume = {2}, publisher = {Princeton University Press}, pages = {245--266}, ) @inproceedings(michalewskiMeasure, author = {Tomasz Gogacz and Henryk Michalewski and Matteo Mio and {Micha{\l} Skrzypczak}}, year = {2014}, title = {Measure Properties of Game Tree Languages}, booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part {I}}, pages = {303--314}, doi = {10.1007/978-3-662-44522-8\_26}, ) @inproceedings(heimbergOptimalGaifman, author = {Lucas Heimberg and Dietrich Kuske and Nicole Schweikardt}, year = {2013}, title = {An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree}, booktitle = {Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science}, series = {LICS '13}, publisher = {IEEE Computer Society}, address = {Washington, DC, USA}, pages = {63--72}, doi = {10.1109/LICS.2013.11}, ) @book(kechrisDescriptive, author = {Alexander Kechris}, year = {1995}, title = {Classical descriptive set theory}, publisher = {Springer-Verlag}, address = {New York}, doi = {10.1007/978-1-4612-4190-4}, ) @inproceedings(michalewskiCompMeasure, author = {Henryk Michalewski and Matteo Mio}, year = {2015}, title = {On the Problem of Computing the Probability of Regular Sets of Trees}, booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015, Bangalore, India}, pages = {489--502}, doi = {10.4230/LIPIcs.FSTTCS.2015.489}, ) @article(mioBranchingGames, author = {Matteo Mio}, year = {2012}, title = {{Probabilistic modal {$\mu$}-calculus with independent product}}, journal = {{Logical Methods in Computer Science}}, volume = {{Volume 8, Issue 4}}, doi = {10.2168/LMCS-8(4:18)2012}, url = {https://lmcs.episciences.org/789}, ) @inproceedings(murlakAcyclic, author = {Filip Murlak and Michal Oginski and Marcin Przybylko}, year = {2012}, title = {Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity?}, booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings}, pages = {705--717}, doi = {10.1007/978-3-642-32589-2\_61}, ) @phdthesis(potthoffExample, author = {Andreas Potthoff}, year = {1994}, title = {Logische {Klassifizierung} regul\"arer {Baumsprachen}}, school = {Universit\"at Kiel}, ) @inproceedings(przybylkoRegularBranchingGamesMFCS, author = {Marcin Przybylko and {Micha{\l} Skrzypczak}}, year = {2016}, title = {On the Complexity of Branching Games with Regular Conditions}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland}, pages = {78:1--78:14}, doi = {10.4230/LIPIcs.MFCS.2016.78}, ) @article(staigerMesureOnWords, author = {Ludwig Staiger}, year = {1998}, title = {The Hausdorff Measure of Regular omega-languages is Computable}, journal = {Bulletin of the EATCS}, volume = {66}, pages = {178--182}, ) @book(suciuProbDatabases, author = {Dan Suciu and Dan Olteanu and Christopher R{\'{e}} and Christoph Koch}, year = {2011}, title = {Probabilistic Databases}, series = {Synthesis Lectures on Data Management}, publisher = {Morgan {\&} Claypool Publishers}, doi = {10.2200/S00362ED1V01Y201105DTM016}, ) @inproceedings(thomasLanguages, author = {Wolfgang Thomas}, year = {1996}, title = {Languages, Automata, and Logic}, booktitle = {Handbook of Formal Languages}, publisher = {Springer}, pages = {389--455}, )