Measure Properties of Game Tree Languages

DOI10.1007/978-3-662-44522-8_26zbMath1425.68202OpenAlexW210314216MaRDI QIDQ2922025

Henryk Michalewski, Michał Skrzypczak, Tomasz Gogacz, Matteo Mio

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44522-8_26

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Modal logic (including the logic of norms) (03B45)

Related Items (6)

Measure Quantifier in Monadic Second Order Logic ⋮ Baire Category Quantifier in Monadic Second Order Logic ⋮ Measure properties of regular sets of trees ⋮ Unnamed Item ⋮ A Characterisation of Pi^0_2 Regular Tree Languages ⋮ An upper bound on the complexity of recognizable tree languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed probabilistic and quantum strategies
• Results on the propositional \(\mu\)-calculus
• Borel-programmable functions
• On the equivalence of game and denotational semantics for the probabilistic mu-calculus
• On Topological Completeness of Regular Tree Languages
• Classical hierarchies from a modern standpoint. Part II. R-sets
• Kolmogorov's ideas in the theory of operations on sets
• Fixpoints, games and the difference hierarchy
• Probabilistic modal {\mu}-calculus with independent product
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• CONCUR 2004 - Concurrency Theory
• Computer Science Logic
• The modal mu-calculus alternation hierarchy is strict

This page was built for publication: Measure Properties of Game Tree Languages