The μ-calculus alternation-depth hierarchy isstrict on binary trees

E-ISSN： 1290-385x|33|4-5|329-339

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.33, Iss.4-5, 2010-03, pp. : 329-339

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Fixpoint alternation: arithmetic, transition systems, and the binary tree

By Bradfield J. C.

RAIRO - Theoretical Informatics and Applications, Vol. 33, Iss. 4-5, 2010-03 ,pp. : 341-356

Edp Sciences

Access to resources Recommend Favorite

On global induction mechanisms in a μ-calculus with explicitapproximations

By Sprenger Christoph Dam Mads

RAIRO - Theoretical Informatics and Applications, Vol. 37, Iss. 4, 2010-03 ,pp. : 365-391

Edp Sciences

Access to resources Recommend Favorite

Some results on complexity of μ-calculus evaluation in the black-box model∗

By Parys Paweł

RAIRO - Theoretical Informatics and Applications, Vol. 47, Iss. 1, 2013-02 ,pp. : 97-109

Edp Sciences

Access to resources Recommend Favorite

The Helping Hierarchy

By Cintioli Patrizio Silvestri Riccardo

RAIRO - Theoretical Informatics and Applications, Vol. 35, Iss. 4, 2010-03 ,pp. : 367-377

Edp Sciences

Access to resources Recommend Favorite

Hierarchy Theory

Ecology, Vol. 55, Iss. 5, 1974-08 ,pp. : 1174-1174

John Wiley & Sons Inc

Access to resources Recommend Favorite