An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma

DOI10.1016/0304-3975(95)00069-9zbMath0873.68157OpenAlexW2048686066WikidataQ124999909 ScholiaQ124999909MaRDI QIDQ672383

André Arnold

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00069-9

zbMATH Keywords

tree automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

A selection property of the boolean $\mu $-calculus and some of its applications ⋮ Free \(\mu\)-lattices ⋮ Infinite games on finitely coloured graphs with applications to automata on infinite trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Alternating automata on infinite trees
• Infinite trees and automaton-definable relations over \(\omega\)-words
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma