The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
From MaRDI portal
Recommendations
- Theμ-calculus alternation-depth hierarchy is strict on binary trees
- An initial semantics for the -calculus on trees and Rabin's complementation lemma
- Nested semantics over finite trees are equationally hard (invited talk)
- Efficiently deciding -calculus with converse over finite trees
- scientific article; zbMATH DE number 1950257
- Nested semantics over finite trees are equationally hard
- Modal μ-Calculus and Alternating Tree Automata
- scientific article; zbMATH DE number 1943845
- Tree-depth, quantifier elimination, and quantifier rank
- The Complexity of Tree Automata and Logics of Programs
Cites work
- A Combinatorial Theorem for Trees
- Algorithms for determining relative star height and star height
- Distance desert automata and the star height problem
- Generalized finite automata theory with an application to a decision problem of second-order logic
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- Transition graphs and the star-height of regular events
- Tree acceptors and some of their applications
Cited in
(7)- Automata and rational expressions
- Stamina: stabilisation monoids in automata theory
- Nested semantics over finite trees are equationally hard (invited talk)
- Distance desert automata and star height substitutions.
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- Boundedness of conjunctive regular path queries
- Weak MSO with the unbounding quantifier
This page was built for publication: The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540194)
