Finite automata have two states, Accept state or Reject state. When the input string is processed successfully, and the automata reached its final state, then it will accept. A finite automaton is a collection of 5-tuple (Q, ∑, δ, q0, F), where:
For More Information Please Refer: