On modal mu-calculus and Büchi tree automata
- 14 April 1995
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 54 (1) , 17-22
- https://doi.org/10.1016/0020-0190(94)00227-p
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- SnS can be modally characterizedTheoretical Computer Science, 1990
- Logical definability of fixed pointsTheoretical Computer Science, 1988
- The greatest fixed-points and rational omega-tree languagesTheoretical Computer Science, 1986
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Weakly Definable Relations and Special AutomataPublished by Elsevier ,1970