From Regular Expressions to AutomataExplores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
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.
Constructing a Lexer: First SymbolsCovers the computation of 'nullable' and 'first' for regular expressions, converting expressions into a lexer, and handling token priorities.
Engineering Projects OverviewProvides an overview of engineering projects, troubleshooting tips, and practical demonstrations on signal processing and Arduino integration.