Measure properties of regular sets of trees
From MaRDI portal
Publication:2407093
DOI10.1016/J.IC.2017.04.012zbMath1376.68092OpenAlexW2759810638MaRDI QIDQ2407093
Matteo Mio, Michał Skrzypczak, Henryk Michalewski, Tomasz Gogacz
Publication date: 28 September 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2017.04.012
Formal languages and automata (68Q45) Descriptive set theory (03E15) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (3)
Unnamed Item ⋮ The uniform measure of simple regular sets of infinite trees ⋮ Monadic Second Order Logic with Measure and Category Quantifiers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- Borel-programmable functions
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- On Topological Completeness of Regular Tree Languages
- Measure Properties of Game Tree Languages
- Classical hierarchies from a modern standpoint. Part II. R-sets
- R-Sets and Category
- Kolmogorov's ideas in the theory of operations on sets
- Fixpoints, games and the difference hierarchy
- Memoir on the Analytical Operations and Projective Sets (I)
- Probabilistic modal {\mu}-calculus with independent product
- Theμ-calculus alternation-depth hierarchy is strict on binary trees
- On absolutely measurable sets
- Computer Science Logic
- An upper bound on the complexity of recognizable tree languages
- Decidability of Second-Order Theories and Automata on Infinite Trees
- The modal mu-calculus alternation hierarchy is strict
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
This page was built for publication: Measure properties of regular sets of trees
