Abstract
We show that a modal mu-calculus with label set {1,...,n} can define the Rabin recognizable tree languages up to an equivalence similar to the observational equivalence of Milner.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Theoretical Computer Science |
Vol/bind | 74 |
Udgave nummer | 2 |
Sider (fra-til) | 239-248 |
Antal sider | 10 |
ISSN | 0304-3975 |
DOI | |
Status | Udgivet - 1990 |
Udgivet eksternt | Ja |