Lectures related to Induction of regular languages

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.

Covers regular expressions, Kleene's contributions, logic, lexical analysis, and manual lexer construction.

Covers the fundamentals of finite automata and formal languages.

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Introduces the CYK parsing algorithm for context-free grammars, explaining its handling of ambiguity and importance in parsing general grammars.

Explains the transformation from a DFA to a Regular Expression and discusses important concepts in automata theory.