Finite Automata: Regular Expressions and Deterministic Finite Automaton

Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.

Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.

Covers the fundamentals of regular expressions and includes exercises on defining languages.

Explains the transformation from a DFA to a Regular Expression and discusses important concepts in automata theory.

Covers a recap on NFAs and introduces the determinization process.