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.
Operations on Formal LanguagesExplores formal language operations, including concatenation, union, intersection, and Kleene star for language repetition.
Constructing a Lexer: First SymbolsCovers the computation of 'nullable' and 'first' for regular expressions, converting expressions into a lexer, and handling token priorities.
Context-Free GrammarsCovers context-free grammars, their equivalence to pushdown automata, and the hierarchy of grammar types.
Universal Source CodingCovers the Lempel-Ziv universal coding algorithm and invertible finite state machines in information theory.
