Pages that link to "Item:Q672383"
From MaRDI portal
The following pages link to An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma (Q672383):
Displaying 6 items.
- Infinite games on finitely coloured graphs with applications to automata on infinite trees (Q1276252) (← links)
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (Q3540194) (← links)
- An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees (Q3557849) (← links)
- Frame Definability for Classes of Trees in the μ-calculus (Q3586099) (← links)
- A selection property of the boolean $\mu $-calculus and some of its applications (Q4380557) (← links)
- Free \(\mu\)-lattices (Q5960406) (← links)