A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
This paper presents translations forth and back between formulas of the linear time µ-calculus and finite automata with a weak parity acceptance condition. This yields a normal form for these formulas, in fact showing that the linear time alternation hierarchy collapses at level 0 and not just at level 1 as known so far. The translation from formulas to automata can be optimised yielding automata whose size is only exponential in the alternation depth of the formula. describing, resp. thedoi:10.1007/978-3-540-30579-8_18 fatcat:ixe5hogilnhq5fjy7iskzhuvjm