There is no notion of "more correct" so your inverted commas around "more" are well placed. An analogous question would be something like, "There are many different ways of writing a given program – which is 'most' correct?"
In theoretical terms, any automaton that accepts a language is as good as any other. The existence of an automaton means the language is regular; non-existence means it isn't.
In practical terms, there may be a preference for the automaton with the least number of states, since that requires less memory to implement.
For teaching purposes, there may be a preference for automata with simple structure and states whose "function" is easily described. For example, suppose you're asked to produce an automaton for $(a+b)^*(ab)^+$. It's much easier to describe the three-state nondeterministic automaton that "guesses" when the $(a+b)^*$ part of the string ends and then checks that the rest of the string matches $(ab)^+$ than it is to describe the corresponding deterministic automaton.