Pages that link to "Item:Q1193871"
From MaRDI portal
The following pages link to Alternating automata, the weak monadic theory of trees and its complexity (Q1193871):
Displaying 9 items.
- On mathematical contributions of Paul E. Schupp (Q716386) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Automata on infinite trees (Q2074210) (← links)
- A focus system for the alternation-free \(\mu \)-calculus (Q2142090) (← links)
- On the separation question for tree languages (Q2254515) (← links)
- The<i>μ</i>-calculus alternation-depth hierarchy is strict on binary trees (Q4943546) (← links)
- (Q4989409) (← links)
- Converting a Büchi alternating automaton to a usual nondeterministic one (Q5955787) (← links)
