Computing measures of weak-mso definable sets of trees
From MaRDI portal
Cites work
- A gap property of deterministic tree languages.
- Algorithms in real algebraic geometry
- Automata, logics, and infinite games. A guide to current research
- Continuous Fragment of the mu-Calculus
- CPO's of measures for nondeterminism
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 1236373 (Why is no real title available?)
- scientific article; zbMATH DE number 475417 (Why is no real title available?)
- scientific article; zbMATH DE number 3999901 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Measure properties of regular sets of trees
- Model Checking Stochastic Branching Processes
- On computing the measures of first-order definable sets of trees
- On the equivalence of game and denotational semantics for the probabilistic -calculus
- On the problem of computing the probability of regular sets of trees
- Quantitative stochastic parity games
- Rabin-Mostowski index problem: a step beyond deterministic automata
- Temporal logics in computer science. Finite-state systems
- The Borel hierarchy is infinite in the class of regular sets of trees
- The complexity of elementary algebra and geometry
- The complexity of probabilistic verification
This page was built for publication: Computing measures of weak-mso definable sets of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842434)
