Finite Automata: BasicsIntroduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
Regularity of Weak SolutionsExplores elliptic PDEs, weak solutions, regularity, and strong solutions, with a focus on classical solutions and proof techniques.
Operations on Formal LanguagesExplores formal language operations, including concatenation, union, intersection, and Kleene star for language repetition.
From Regular Expressions to AutomataExplores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
