There are several versions of the definitions of the finite state transducer (FST) and the Mealy machine. Some of the definitions are almost same, while others have a few differences. However, it seems that both are a kind of deterministic finite automaton (DFA) with an output function $G : \Sigma \times Q \to \Gamma \times Q$, where $\Sigma$ is the input alphabet and $\Gamma$ is the output alphabet. I'm not sure about the differences between them. Are they the same machines? Why are there two different names?
By the way, I found that there is not the set of final states in the definition of Mealy machines or Moore machines. On the other hand, final states do exist in the definition of FST, although Mealy machine is one type of FST. Does it mean that final state is not important when we are talking about the Mealy machines?