A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Size matters in the modal μ-calculus
[article]

2020
*
arXiv
*
pre-print

We discuss and compare complexity measures for the modal μ-calculus, focusing on size and alternation depth. As a yardstick we take Wilke's alternating tree automata, which we shall call parity formulas in the text. Building on work by Bruse, Friedmann Lange, we compare two size measures for μ-calculus formulas: subformula-size,i.e. , the number of subformulas of the given formula, and closure-size. These notions correspond to the representation of a formula as a parity formula based on,

arXiv:2010.14430v1
fatcat:fvndfh2gkvcm3fe7dfbtk6wo34