Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)
Strictness of the Modal μ-Calculus Hierarchy
The two main results of this chapter are the translation of alternating automata into the modal μ-calculus and the hierarchy theorem for the modal μ-calculus.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 2002