@inproceedings{be34de2f23dd4f22b34aeaaa4324dc25,
title = "The quest for a tight translation of B{\"u}chi to co-B{\"u}chi automata",
abstract = "The B{\"u}chi acceptance condition specifies a set α of states, and a run is accepting if it visits α infinitely often. The co-B{\"u}chi acceptance condition is dual, thus a run is accepting if it visits α only finitely often. Nondeterministic B{\"u}chi automata over words (NBWs) are strictly more expressive than nondeterministic co-B{\"u}chi automata over words (NCWs). The problem of the blow-up involved in the translation (when possible) of an NBW to an NCW has been open for several decades. Until recently, the best known upper bound was 2 O(n log n) and the best lower bound was n. We describe the quest to the tight 2Θ(n) bound.",
keywords = "B{\"u}chi automata, automata translation, co-B{\"u}chi automata, nondeterminism",
author = "Udi Boker and Orna Kupferman",
year = "2010",
doi = "10.1007/978-3-642-15025-8_8",
language = "אנגלית",
isbn = "3642150241",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "147--164",
booktitle = "Fields of Logic and Computation - Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday",
note = "35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, and 19th EACSL Annual Conference on Computer Science Logic, CSL 2010 ; Conference date: 22-08-2010 Through 22-08-2010",
}