Measure Properties of Game Tree Languages

Tomasz Gogacz, Henryk Michalewski, Matteo Mio, Michal Skrzypczak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We introduce a general method for proving measurability of topologically complex sets by establishing a correspondence between the notion of game tree languages from automata theory and the σ-algebra of R-sets, introduced by A. Kolmogorov as a foundation for measure theory. We apply the method to answer positively to an open problem regarding the game interpretation of the probabilistic μ-calculus.
Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2014
Subtitle of host publication39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I
PublisherSpringer Berlin Heidelberg
Pages303-314
Number of pages12
ISBN (Electronic)978-3-662-44522-8
ISBN (Print)978-3-662-44521-1
DOIs
Publication statusPublished - 2014

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume8634
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Measure Properties of Game Tree Languages'. Together they form a unique fingerprint.

Cite this