Difference between Deterministic Finite Automata & Non Deterministic Finite Automata

DETERMINISTIC FINITE STATE AUTOMATA	NON DETERMINISTIC FINITE STATE AUTOMATA
It is a finite-state machine that accepts and rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string.	It is a finite-state machine that accepts and rejects strings of symbols and produces a number of computation (or run) of the automaton for each input string.
It consist of 5 tuple:      L = {Q, q0, ∑, F, Δ }	It consist of 5 tuples:      L = {Q, q0, ∑, F, Δ }
Transition Function is         Δ : Q × Σ → Q	Transition Function is       Δ : Q × Σ → 2Q
Only one transition is possible for single input symbol from any states	Many transition is possible for single input symbol from any states
No transition can occur without consuming any input symbol	Transition may occur without consuming any input symbol known as NFA-Ԑ transition
It can represent only limited number of regular expression	It can be used to represent large number of regular expression