An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma
From MaRDI portal
Publication:672383
DOI10.1016/0304-3975(95)00069-9zbMath0873.68157WikidataQ124999909 ScholiaQ124999909MaRDI QIDQ672383
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
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
Related Items
A selection property of the boolean $\mu $-calculus and some of its applications, Free \(\mu\)-lattices, Infinite games on finitely coloured graphs with applications to automata on infinite trees
Cites Work