An initial semantics for the -calculus on trees and Rabin's complementation lemma

DOI10.1016/0304-3975(95)00069-9zbMATH Open0873.68157OpenAlexW2048686066WikidataQ124999909 ScholiaQ124999909MaRDI QIDQ672383FDOQ672383

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2102757
• Rudiments of \(\mu\)-calculus
• Ambiguous classes in \(\mu\)-calculi hierarchies
• An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees

zbMATH Keywords

tree automaton

Mathematics Subject Classification ID

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

Cites Work

• Decidability of Second-Order Theories and Automata on Infinite Trees
• Results on the propositional \(\mu\)-calculus
• Alternating automata on infinite trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Infinite trees and automaton-definable relations over \(\omega\)-words
• Title not available (Why is that?)

Cited In (7)

• Title not available (Why is that?)
• Frame Definability for Classes of Trees in the μ-calculus
• The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
• Free \(\mu\)-lattices
• A selection property of the boolean $\mu $-calculus and some of its applications
• An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees
• Infinite games on finitely coloured graphs with applications to automata on infinite trees

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)