Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches
cs.FL, cs.LO
Submitted: 2026-11-06
Updated: 2026-11-06
Terminology
Sources
- MSO logic of the real order with the set quantifiers ranging over the Borel sets
- Games on Graphs: From Logic and Automata to Algorithms
- The Borel monadic theory of order is decidable
Related papers
- Quantitative Verification of Infinite-State Networks
- A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
- Positive-Data Learning of Fixed-Observation Linear MCFGs from Working Binary Presentations
- On the Separability Problem of VASS Reachability Languages
- Exact Accepting-State Spectrum for Reversal of Permutation Automata
- On Word Representations and Embeddings in Complex Matrices