Theμ-calculus alternation-depth hierarchy is strict on binary trees-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Theμ-calculus alternation-depth hierarchy is strict on binary trees

Published:1999-07 Issue:4-5 Volume:33 Page:329-339
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Arnold André

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita:1999121/pdf

Reference17 articles.

1. Logical definability of fixed points

2. A. Arnold and D. Niwinski, Fixed-point characterization of büchi automata on infinite trees.J. Inf. Process. Cybern. EIK26(1990).

3. A. Arnold and D. Niwinski, Fixed point characterization of weak monadic logic definable sets of trees, M. Nivat and A. Podelski, Eds.,Tree automata and Languages. Elsevier (1992) 159-188.

4. J.C. Bradfield, Fixpoint alternation: Arithmetic, transition systems, and the binary tree,this issue.

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

1. The Alternation Hierarchy of the $$\mu $$-calculus over Weakly Transitive Frames;Logic, Language, Information, and Computation;2022

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

3. Specifying Program Properties Using Modal Fixpoint Logics: A Survey of Results;Logic and Its Applications;2019

4. The μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs;Theoretical Computer Science;2018-08

5. The mu-calculus and Model Checking;Handbook of Model Checking;2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP