When does an automata move to the next state?

It takes the string of symbol as input and changes its state accordingly. When the desired symbol is found, then the transition occurs. At the time of transition, the automata can either move to the next state or stay in the same state. Finite automata have two states, Accept state or Reject state.
For More Information Please Refer:

You May Also Like to Read: