Is it possible for a DFA to change its state to a new state without accepting any input symbol

Question

Is it possible for a DFA to change its state without accepting its state i.e-

for instance,

A(self loop of (a,b) over state A)--->B.......... 

for input symbols - (a,b)

Answer 1

In computer science epsilon transistions are used for that. But you will usually get a NDFA, and you can always eliminate the epsilon transitions to obtain an equivalent automata without epsilon transitions.