joint work with Thomas Colcombet

We present a lower bound for the problem of translating a Buchi word automaton into a deterministic Rabin word automaton when both the Buchi and the Rabin conditions label transitions rather than states. This lower bound exactly matches the known upper bound to this problem.