Mikolaj Bojańczyk (2016):
Thin MSO with a probabilistic path quantifier.
In: Proc. of ICALP.
Arnaud Carayol, Axel Haddad & Olivier Serre (2014):
Randomization in Automata on Infinite Trees.
ACM Trans. Comput. Log. 15(3),
pp. 24:1–24:33,
doi:10.1145/2629336.
A. S. Kechris (1994):
Classical Descriptive Set Theory.
Springer Verlag,
doi:10.1007/978-1-4612-4190-4.
Henryk Michalewski & Matteo Mio (2016):
Measure Quantifier in Monadic Second Order Logic.
In: Logical Foundations of Computer Science - International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings,
pp. 267–282,
doi:10.1007/978-3-319-27683-0_19.
Michael O. Rabin (1969):
Decidability of second-order theories and automata on infinite trees.
Transactions of American Mathematical Society 141,
pp. 1–35,
doi:10.1090/S0002-9947-1969-0246760-1.
Wolfgang Thomas (1997):
Handbook of Formal Languages: Volume 3 Beyond Words, chapter Languages, Automata, and Logic,
pp. 389–455.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
doi:10.1007/978-3-642-59126-6_7.
eptcs@eptcs.org