Pages that link to "Item:Q805253"
From MaRDI portal
The following pages link to Hierarchies of weak automata and weak monadic formulas (Q805253):
Displaying 19 items.
- Alternating automata with start formulas (Q915487) (← links)
- A gap property of deterministic tree languages. (Q1401364) (← links)
- Complexity of weak acceptance conditions in tree automata. (Q1853134) (← links)
- On the separation question for tree languages (Q2254515) (← links)
- Weak morphisms of higher dimensional automata (Q2449047) (← links)
- (Q2754058) (← links)
- Definable operations on weakly recognizable sets of trees (Q2911638) (← links)
- On the Weak Index Problem for Game Automata (Q2947463) (← links)
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (Q3644751) (← links)
- (Q3787992) (← links)
- Permissive strategies: from parity games to safety games (Q4800258) (← links)
- Weak index versus Borel rank (Q4910751) (← links)
- The<i>μ</i>-calculus alternation-depth hierarchy is strict on binary trees (Q4943546) (← links)
- Computing the Rabin Index of a Parity Automaton (Q4953338) (← links)
- Weak equivalence of higher-dimensional automata (Q5038191) (← links)
- On the Way to Alternating Weak Automata (Q5090957) (← links)
- Index Problems for Game Automata (Q5278187) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5711494) (← links)
- Axiomatising extended computation tree logic (Q5878903) (← links)