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.
Spelling Error CorrectionExplores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.
Context-Free GrammarsCovers context-free grammars, their equivalence to pushdown automata, and the hierarchy of grammar types.
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.
Lexicons, n-grams and Language ModelsExplores lexicons, n-grams, and language models, emphasizing their importance in recognizing words and the effectiveness of n-grams for various tasks.
