Pages that link to "Item:Q3519517"
From MaRDI portal
The following pages link to The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (Q3519517):
Displaying 16 items.
- Weak MSO with the unbounding quantifier (Q537919) (← links)
- \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\) (Q2011666) (← links)
- Automata on infinite trees (Q2074210) (← links)
- Stamina: stabilisation monoids in automata theory (Q2399252) (← links)
- (Q3384164) (← links)
- Trading Bounds for Memory in Games with Counters (Q3449476) (← links)
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (Q3540194) (← links)
- R-Automata (Q3541011) (← links)
- (Q5014447) (← links)
- A Characterisation of Pi^0_2 Regular Tree Languages (Q5111272) (← links)
- Universality of R-automata with Value Copying (Q5179055) (← links)
- Monoidal-closed categories of tree automata (Q5220183) (← links)
- (Q5232909) (← links)
- Index Problems for Game Automata (Q5278187) (← links)
- Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
