Giovanna D'Agostino, Giacomo Lenzi. μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs. Theoretical Computer Science, 737:40-61, 2018. [doi]
@article{DAgostinoL18,
title = {μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs},
author = {Giovanna D'Agostino and Giacomo Lenzi},
year = {2018},
doi = {10.1016/j.tcs.2018.04.009},
url = {https://doi.org/10.1016/j.tcs.2018.04.009},
researchr = {https://researchr.org/publication/DAgostinoL18},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {737},
pages = {40-61},
}