Regular Expressions: Basics and Applications

Related lectures (31)

Page 1 of 4

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.