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
We solve the longstanding open problems of the blowup involved in the translations (when possible) of a nondeterministic Büchi word automaton (NBW) to a nondeterministic co-Büchi word automaton (NCW) and to a deterministic co-Büchi word automaton (DCW). For the NBW to NCW translation, the currently known upper bound is 2 O(n log n) and the lower bound is 1.5n. We improve the upper bound to n2 n and describe a matching lower bound of 2 Ω(n) . For the NBW to DCW translation, the currently knowndoi:10.1109/lics.2009.32 dblp:conf/lics/BokerK09 fatcat:icpdnxsd2nhmdgfhtl6e2bsbru