Yes Maybe. If the machine is not an acceptor, but a converter, then the final state is not required.
Any automation class can be without a final state! Automata can be considered as a finite representation of a formal language (which can be an infinite set). Automata with final state (s) are called acceptors. For example, the DFA accepts or rejects a string as an acceptor and is a common language.
, . .
- Mealy Moor.