When we have a NDet-G, NDet-F, NDet-FG or NDet-GF automaton then the accepting states are defined by the acceptance conditions G phi, F phi, FG phi, and GF phi as the set of states that satisfy phi. In the above case, there is a set of sets of accepting states, and we may list the union in the graph, but we should better use different colors for each particular state set. So, we get the accepting states always from the acceptance conditions.