User:Kanchan kalunge/sandbox

Deterministic finite automata
This is a type of automata.

formal definition

 * DFA is(Q,Σ,δ,I,F)
 * Q Finite set of states.
 * Σ is the ﬁnite alphabet.
 * q0∈Q the initial states.
 * F⊆Q set of ﬁnal states.
 * δ:Q×Σ→Q transition function.


 * A run of DFAA on u=a0,a1,...,an−1 is a sequence of states q0,q1,...,qn such that δ(qi,ai-1)=qi+1 for0≤i<n.
 * For the given word 'u' the DFA has a unique run.
 * Languages accepted by DFA are called Regular languages