Lecture 1: Deterministic Finite Automata (DFA) (الأوتوماتا المنتهية الحتمية)

This lecture introduces the simplest model of computation, namely, deterministic finite state automata. It is just a control with no memory and read-once input. Regular languages are introduced in terms of accepting DFAs. Lecturing is done in Arabic, however, all formulations, examples, equations, definitions, etc., are given in English.