Ambiguous classes in <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>μ</mml:mi></mml:math>-calculi hierarchies-Reference-Cited by-同舟云学术

Ambiguous classes in μ-calculi hierarchies

Published:2005-03 Issue:1-2 Volume:333 Page:265-296
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Santocanale Luigi,Arnold André

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference37 articles.

1. The μ-calculus alternation-depth hierarchy is strict on binary trees;Arnold;Theor. Inform. Appl.,1999

2. Fixed point characterization of Büchi automata on infinite trees;Arnold;J. Inf. Process. Cybern. EIK,1990

3. A. Arnold, D. Niwiński, Fixed point characterization of weak monadic logic definable sets of trees. in: Tree automata and languages (Le Touquet, 1990), Vol. 10, Studies in Computational Science and Artificial Intelligence, North-Holland, Amsterdam, 1992, pp. 159–188.

4. A. Arnold, D. Niwiński, Rudiments of μ-calculus, Vol. 146, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 2001.

5. Games for synthesis of controllers with partial observation;Arnold;Theoret. Comput. Sci.,2003

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computer Speech Recognition Technology and Graphic Shape Design;Advances in Multimedia;2022-05-11

2. Monoidal-closed categories of tree automata;Mathematical Structures in Computer Science;2020-01

3. On the Strength of Unambiguous Tree Automata;International Journal of Foundations of Computer Science;2018-08

4. $$\mu $$ μ -Levels of Interpolation;Larisa Maksimova on Implication, Interpolation, and Definability;2018

5. Index Problems for Game Automata;ACM Transactions on Computational Logic;2016-11-15