Deterministic Finite Automata (DFA) are defined. An intuitive understanding is provided.

This video is especially useful for beginners.

NOTE: In the example: "strings that start and end with an a", there is an implicit assumption that the length of a word is two or more. We address the situation where no such restriction exists in the following short clip:
   • Deterministic Finite Automata: Constr...