An initial semantics for the -calculus on trees and Rabin's complementation lemma
From MaRDI portal
(Redirected from Publication:672383)
An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma
An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma
Recommendations
Cites work
- scientific article; zbMATH DE number 3960988 (Why is no real title available?)
- scientific article; zbMATH DE number 475417 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1995184 (Why is no real title available?)
- Alternating automata on infinite trees
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Infinite trees and automaton-definable relations over \(\omega\)-words
- Results on the propositional \(\mu\)-calculus
Cited in
(7)- Free \(\mu\)-lattices
- An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees
- Frame Definability for Classes of Trees in the μ-calculus
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- scientific article; zbMATH DE number 2102757 (Why is no real title available?)
- A selection property of the boolean $\mu $-calculus and some of its applications
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
This page was built for publication: An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672383)
