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