Acceptance of Strings :

A DFA accepts a string if there is a sequence of states in Q such that

1. is the start state.

2. for all .

3. .