Deterministic Finite Automata (DFA)

There are five tuples in Finite Automata:

Q: a finite set of states 

q0= initial state.

f=   final state(F ⊆ Q)

∑= input alphabets.

δ= Input transition function.

δ  for DFA is defined as you are on some state and on seeing a particular symbol you are going to only one state. 

δ= Q X ∑ --> Q.

In DFA for every state, for every input, there is exactly one transition function.

Some examples of DFA.