Finite Automata: BasicsIntroduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
From Regular Expressions to AutomataExplores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Introduction to GrammarsIntroduces automata, regular languages limitations, context-free grammars, and balanced parentheses grammars.
Constructing a Lexer: First SymbolsCovers the computation of 'nullable' and 'first' for regular expressions, converting expressions into a lexer, and handling token priorities.
Perspective: Radial MethodCovers the concept of perspective in geometry and the radial method of creating images using central projection.