So, if you have an omega-automaton without acceptance condition, you can add the acceptance condition G true to make it a safety automaton. If you determinize it, you get an acceptance condition G phi with some state set phi. The negation such an automaton is a F-automaton since for deterministic automata, you just have to negate the acceptance condition. Hence, to translation [a SU b] to a F-automaton, you may translate ![a SU b] to a G-automaton, determinize it, and negate it to obtain a deterministic F-automaton for [a SU b].

P.S.: Positive/negative occurrences means whether the occurrence is behind an even or odd number of negations.