The μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs

被引：2

作者：

D'Agostino, Giovanna ^{[1
]}

Lenzi, Giacomo ^{[2
]}

机构：

[1] Univ Udine, Dept Math Comp Sci & Phys, Via Sci 206, I-33100 Udine, Italy

[2] Univ Salerno, Dept Math, Via Giovanni Paolo 2 132, I-84084 Salerno, Italy

来源：

THEORETICAL COMPUTER SCIENCE | 2018年 / 737卷

关键词：

Modal mu-Calculus; Alternation hierarchy; Parity games; Planar graphs; AUTOMATA; STRICT; TREES;

D O I：

10.1016/j.tcs.2018.04.009

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：40 / 61

页数：22

共 50 条

[1] The monadic quantifier alternation hierarchy over graphs is infinite
Matz, O
Thomas, W
[J]. 12TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1997, : 236 - 244
[2] The Alternation Hierarchy of the μ-calculus over Weakly Transitive Frames
Pacheco, Leonardo
Tanaka, Kazuyuki
[J]. LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, WOLLIC 2022, 2022, 13468 : 207 - 220
[3] The μ-calculus alternation-depth hierarchy is strict on binary trees
Arnold, A
[J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1999, 33 (4-5): : 329 - 339
[4] The monadic quantifier alternation hierarchy over grids and graphs
Matz, O
Schweikardt, N
Thomas, W
[J]. INFORMATION AND COMPUTATION, 2002, 179 (02) : 356 - 383
[5] The μ-calculus alternation hierarchy collapses over structures with restricted connectivity
Gutierrez, Julian
Klaedtke, Felix
Lange, Martin
[J]. THEORETICAL COMPUTER SCIENCE, 2014, 560 : 292 - 306
[6] The bounded weak monadic quantifier alternation hierarchy of equational graphs is infinite
Ly, O
[J]. FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2000, 1974 : 188 - 200
[7] Level Two of the Quantifier Alternation Hierarchy over Infinite Words
Kufleitner, Manfred
Walter, Tobias
[J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2016, 2016, 9691 : 223 - 236
[8] Level Two of the Quantifier Alternation Hierarchy Over Infinite Words
Kufleitner, Manfred
Walter, Tobias
[J]. THEORY OF COMPUTING SYSTEMS, 2018, 62 (03) : 467 - 480
[9] Level Two of the Quantifier Alternation Hierarchy Over Infinite Words
Manfred Kufleitner
Tobias Walter
[J]. Theory of Computing Systems, 2018, 62 : 467 - 480
[10] Bounds for the Quantifier Depth in Finite-Variable Logics: Alternation Hierarchy
Berkholz, Christoph
Krebs, Andreas
Verbitsky, Oleg
[J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2015, 16 (03)

← 1 2 3 4 5 →