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.