Question: can a dfa have no final states?
Answer: Any class of an automata can be without a final state! ... An automata with the final state(s) is called acceptor. For example, A DFA as acceptor either accepts or reject a string and represents a regular language. But another model of automata is called transducer that may not have any final state.