An initial semantics for the μ-calculus on trees and Rabin's complementation lemma
- 21 August 1995
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 148 (1) , 121-132
- https://doi.org/10.1016/0304-3975(95)00069-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Fixed points vs. infinite generationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Infinite trees and automaton- definable relations over ω-wordsTheoretical Computer Science, 1992
- Automata on Infinite ObjectsPublished by Elsevier ,1990
- Alternating automata on infinite treesTheoretical Computer Science, 1987
- On fixed-point clonesPublished by Springer Nature ,1986
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Trees, automata, and gamesPublished by Association for Computing Machinery (ACM) ,1982
- Decidability of Second-Order Theories and Automata on Infinite TreesTransactions of the American Mathematical Society, 1969