On computing the measures of first-order definable sets of trees
From MaRDI portal
Publication:3384891
Authors: Marcin Przybyłko 
Publication date: 17 December 2021
Full work available at URL: https://arxiv.org/abs/1809.03104
Recommendations
Formal languages and automata (68Q45) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- A survey of stochastic \(\omega \)-regular games
- Title not available (Why is that?)
- Conjunctive query containment over trees
- Probabilistic databases
- Provenance circuits for trees and treelike instances
- Model Checking Stochastic Branching Processes
- Between tree patterns and conjunctive queries: is there tractability beyond acyclicity?
- Title not available (Why is that?)
- On the complexity of branching games with regular conditions
- Probabilistic modal \(\mu\)-calculus with independent product
- An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree
- On the problem of computing the probability of regular sets of trees
- Measure Properties of Game Tree Languages
Cited In (8)
- Frame Definability for Classes of Trees in the μ-calculus
- First-Order Definability of Trees and Sparse Random Graphs
- Title not available (Why is that?)
- First-order properties of trees, star-free expressions, and aperiodicity
- Title not available (Why is that?)
- First-order theories of bounded trees
- The Computable Dimension of I-Trees of Infinite Height
- Title not available (Why is that?)
This page was built for publication: On computing the measures of first-order definable sets of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384891)
