Problems and Languages: Regular Languages

Related lectures (30)

Page 2 of 3

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

Introduces the basics of automata theory and explores the theorems of regular languages.

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

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

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

Covers the basics of formal languages, including alphabets, words, and languages, as well as operations like concatenation and reversal.

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

Covers computational methods focusing on paths and strings, including examples of concatenation, regex elements, and string operations.

Delves into renormalization, fractals, and strange attractors, exploring the properties of countable and uncountable sets.

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