Deterministic Finite Automata can be described as

  • Total number of alphabet should be finite.
  • Total number of states should be finite.