Pages that link to "Item:Q3540194"
From MaRDI portal
The following pages link to The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (Q3540194):
Displaying 6 items.
- Weak MSO with the unbounding quantifier (Q537919) (← links)
- Automata and rational expressions (Q2074204) (← links)
- Stamina: stabilisation monoids in automata theory (Q2399252) (← links)
- Nested semantics over finite trees are equationally hard (invited talk) (Q2847402) (← links)
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (Q3519517) (← links)
- (Q5091266) (← links)