Regular Expressions: Basics and Applications

Related lectures (31)

Page 2 of 4

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.