I can't understand how to eliminate the states. I draw this automa and after I create a table of the states (I must minimize it now and after create a minimal table of the states) Is someone who can explain it to me? This is an final state machine (original, not minimizated). In the Paul and Unger diagram I eliminate the equivalent state (are the states that produce the same output). But I see that I done it uncorrectly and I don't know how to proceed. I think that my problem is in process to find the equivalent states.
Welcome to EE.SE! This appears to be a homework question. As such, you need to show us your work so far, and explain which part of the question you're having trouble with. For future reference: Homework questions on EE.SE enjoy/suffer a special treatment. We don't provide complete answers, we only provide hints or Socratic questions, and only when you have demonstrated sufficient effort of your own. Otherwise, we would be doing you a disservice, and getting swamped by homework questions at the same time. See also here.
To minimize a state diagram, you look for states that do the same thing (both next state and outputs) for a given input.
In your state transition table on the left, that means that you are looking for identical rows in the table.
You need to be methodical — it may not be immediately obvious, but states B and F are identical, as are states E and H.
I hope this is enough information to allow you to proceed with the solution.
Note that in your state diagram on the right, you're missing an edge from H to G that's in the table.