The μ-calculus alternation-depth hierarchy is strict on binary trees
RAIRO-Theor. Inf. Appl., 33 4-5 (1999) 329-339
Published online: 2002-08-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Logic, Language, Information, and Computation
Leonardo Pacheco and Kazuyuki TanakaLecture Notes in Computer Science, Logic, Language, Information, and Computation 13468 207 (2022)
https://doi.org/10.1007/978-3-031-15298-6_13
11600 42 (2019)
https://doi.org/10.1007/978-3-662-58771-3_5
The μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs
Giovanna D'Agostino and Giacomo LenziTheoretical Computer Science 737 40 (2018)
https://doi.org/10.1016/j.tcs.2018.04.009
Handbook of Model Checking
Julian Bradfield and Igor WalukiewiczHandbook of Model Checking 871 (2018)
https://doi.org/10.1007/978-3-319-10575-8_26
Unveiling Dynamics and Complexity
Karoliina Lehtinen and Sandra QuickertLecture Notes in Computer Science, Unveiling Dynamics and Complexity 10307 292 (2017)
https://doi.org/10.1007/978-3-319-58741-7_28
1 (2017)
https://doi.org/10.1109/LICS.2017.8005061
Alternation Is Strict For Higher-Order Modal Fixpoint Logic
Florian BruseElectronic Proceedings in Theoretical Computer Science 226 105 (2016)
https://doi.org/10.4204/EPTCS.226.8
The Arity Hierarchy in the Polyadic μ-Calculus
Martin LangeElectronic Proceedings in Theoretical Computer Science 191 105 (2015)
https://doi.org/10.4204/EPTCS.191.10
On the Separation Question for Tree Languages
André Arnold, Henryk Michalewski and Damian NiwińskiTheory of Computing Systems 55 (4) 833 (2014)
https://doi.org/10.1007/s00224-013-9461-4
Automata column
Mikołaj BojańczykACM SIGLOG News 1 (2) 3 (2014)
https://doi.org/10.1145/2677161.2677163
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity
Julian Gutierrez, Felix Klaedtke and Martin LangeTheoretical Computer Science 560 292 (2014)
https://doi.org/10.1016/j.tcs.2014.03.027
On modal -calculus over reflexive symmetric graphs
G. D'Agostino and G. LenziJournal of Logic and Computation 23 (3) 445 (2013)
https://doi.org/10.1093/logcom/exs028
499 (2013)
https://doi.org/10.1109/LICS.2013.56
The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity
Julian Gutierrez, Felix Klaedtke and Martin LangeElectronic Proceedings in Theoretical Computer Science 96 113 (2012)
https://doi.org/10.4204/EPTCS.96.9
Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones
Szczepan HummelElectronic Proceedings in Theoretical Computer Science 96 247 (2012)
https://doi.org/10.4204/EPTCS.96.19
Logic and Program Semantics
Henryk Michalewski and Damian NiwińskiLecture Notes in Computer Science, Logic and Program Semantics 7230 165 (2012)
https://doi.org/10.1007/978-3-642-29485-3_11
Automatentheorie und Logik
Martin Hofmann and Martin LangeeXamen.press, Automatentheorie und Logik 205 (2011)
https://doi.org/10.1007/978-3-642-18090-3_16
Infinity in Logic and Computation
Jacques Duparc and Alessandro FacchiniLecture Notes in Computer Science, Infinity in Logic and Computation 5489 46 (2009)
https://doi.org/10.1007/978-3-642-03092-5_5
5213 354 (2008)
https://doi.org/10.1007/978-3-540-87531-4_26
Automata, Languages and Programming
Thomas Colcombet and Christof LödingLecture Notes in Computer Science, Automata, Languages and Programming 5126 398 (2008)
https://doi.org/10.1007/978-3-540-70583-3_33
Logic for Programming, Artificial Intelligence, and Reasoning
Walid Belkhir and Luigi SantocanaleLecture Notes in Computer Science, Logic for Programming, Artificial Intelligence, and Reasoning 5330 605 (2008)
https://doi.org/10.1007/978-3-540-89439-1_42
Handbook of Modal Logic
Julian Bradfield and Colin StirlingStudies in Logic and Practical Reasoning, Handbook of Modal Logic 3 721 (2007)
https://doi.org/10.1016/S1570-2464(07)80015-2
Finite Model Theory and Its Applications
Erich GrädelTexts in Theoretical Computer Science an EATCS Series, Finite Model Theory and Its Applications 125 (2007)
https://doi.org/10.1007/3-540-68804-8_3
The alternation hierarchy in fixpoint logic with chop is strict too
Martin LangeInformation and Computation 204 (9) 1346 (2006)
https://doi.org/10.1016/j.ic.2006.05.001
Ambiguous classes in μ-calculi hierarchies
Luigi Santocanale and André ArnoldTheoretical Computer Science 333 (1-2) 265 (2005)
https://doi.org/10.1016/j.tcs.2004.10.024
STACS 2005
Dietmar Berwanger and Giacomo LenziLecture Notes in Computer Science, STACS 2005 3404 97 (2005)
https://doi.org/10.1007/978-3-540-31856-9_8
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Igor WalukiewiczLecture Notes in Computer Science, FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science 3821 79 (2005)
https://doi.org/10.1007/11590156_5
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
Damian Niwiński and Igor WalukiewiczElectronic Notes in Theoretical Computer Science 123 195 (2005)
https://doi.org/10.1016/j.entcs.2004.05.015
356 (2004)
https://doi.org/10.1109/LICS.2004.1319630
Domain mu-calculus
Guo-Qiang ZhangRAIRO - Theoretical Informatics and Applications 37 (4) 337 (2003)
https://doi.org/10.1051/ita:2003023
Foundations of Software Science and Computation Structures
André Arnold and Luigi SantocanaleLecture Notes in Computer Science, Foundations of Software Science and Computation Structures 2620 70 (2003)
https://doi.org/10.1007/3-540-36576-1_5
On the equational definition of the least prefixed point
Luigi SantocanaleTheoretical Computer Science 295 (1-3) 341 (2003)
https://doi.org/10.1016/S0304-3975(02)00412-7
A gap property of deterministic tree languages
Damian Niwiński and Igor WalukiewiczTheoretical Computer Science 303 (1) 215 (2003)
https://doi.org/10.1016/S0304-3975(02)00452-8
Deciding low levels of tree-automata hierarchy
Igor WalukiewiczElectronic Notes in Theoretical Computer Science 67 61 (2002)
https://doi.org/10.1016/S1571-0661(04)80541-3
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science
Ralf Küsters and Thomas WilkeLecture Notes in Computer Science, FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science 2556 241 (2002)
https://doi.org/10.1007/3-540-36206-1_22
Monadic Second Order Logic And Its Fragments
Giacomo LenziElectronic Notes in Theoretical Computer Science 51 258 (2002)
https://doi.org/10.1016/S1571-0661(04)80208-1
Computer Science Logic
Damian NiwińskiLecture Notes in Computer Science, Computer Science Logic 2471 27 (2002)
https://doi.org/10.1007/3-540-45793-3_3
Computer Science Logic
Dietmar Berwanger, Erich Grädel and Giacomo LenziLecture Notes in Computer Science, Computer Science Logic 2471 352 (2002)
https://doi.org/10.1007/3-540-45793-3_24
347 (2001)
https://doi.org/10.1109/LICS.2001.932510
Rudiments of μ-Calculus
Studies in Logic and the Foundations of Mathematics, Rudiments of μ-Calculus 146 269 (2001)https://doi.org/10.1016/S0049-237X(01)80013-6
Mathematical Foundations of Computer Science 2001
Luigi SantocanaleLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2001 2136 645 (2001)
https://doi.org/10.1007/3-540-44683-4_56
Fixpoint alternation: arithmetic, transition systems, and the binary tree
J. C. BradfieldRAIRO - Theoretical Informatics and Applications 33 (4-5) 341 (1999)
https://doi.org/10.1051/ita:1999122