An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma (Q672383): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q124999909, #quickstatements; #temporary_batch_1711015421434
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4273664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite trees and automaton-definable relations over \(\omega\)-words / rank
 
Normal rank

Latest revision as of 10:17, 27 May 2024

scientific article
Language Label Description Also known as
English
An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma
scientific article

    Statements

    An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma (English)
    0 references
    0 references
    28 February 1997
    0 references
    tree automaton
    0 references

    Identifiers