Lectures related to Regular Expressions: Basics and Applications

Covers regular languages, encoding, alphabets, words, languages, concatenation, exponentiation, and iterative closure.

Covers the fundamentals of regular expressions and includes exercises on defining languages.

Covers the basics of computational complexity, including big O notation and complexity classes.

Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.

Explores Turing machines, recursive languages, and decidability in the theory of computation.

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

Covers context-free grammars, their equivalence to pushdown automata, and the hierarchy of grammar types.

Provides an overview of lambda calculus, type safety, and type inference in programming languages.

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

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

Covers the use of the enum keyword to define integer constants and improve code readability in programming.

Covers the semantics of programming languages, focusing on the Add language and the role of rewriting rules and CK machines in understanding meaning.

Explores Turing machines, recursive languages, undecidability, and symbol elimination.

Covers Hoare Logic, its foundations, applications, and significance in program verification.

Explores Ramanujan graphs, generating functions, non-backtracking walks, and expander graphs in relation to NP-hard problems.

Explores pseudorandomness theory, AI challenges, pseudo-random graphs, random walks, and matrix properties.

Covers deterministic pushdown automata and their use in language recognition.

Covers the energy and radiation of LEDs, transitions in energy levels, and color synthesis.

Covers the design and programming of Thymio robots.

Covers the basics of induction, syntax, abstract vs. concrete syntax, and operational semantics for Booleans.