You can list all transitions as minterms which results in a full DNF of the transition relation which is no better than the explicit listing of the transitions (thus not making use of the symbolic representation). You have to use inputs as well for doing so, and that can be done for all automata. As the state transition diagram shown has wildcard * transitions, you better use them also instead of listing all input combinations.
