Introduction: The DFA machine can exist in only one state at any given time. It accepts a string if starting from the start state and moving from state to state, each time following the arrow that corresponds the current input character, it reaches a final state when the entire input string is consumed. Otherwise, it rejects the string.
A DFA is defined by the 5-tuple: {Q ∑ q F δ }
Q ==> a finite set of states
∑ ==> a finite set of input symbols (alphabet)
q0 ==>> a start state
F ==> set of final states
δ ==> a transition function, which is a mappingbetween Q x ∑∑ ==> QQ
