Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
Delves into the proof of the convergence rate theorem for an ergodic Markov chain, emphasizing eigenvalues and detailed balance properties.
Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Explores tail bounds, information bounds, and maximal leakage in the context of generalization error.
Covers hitting probabilities in Markov chains with disjoint subsets, the function h(i), theorems, proofs, and expected time to hit calculations.
Explores Markov chains and their applications in algorithms, focusing on user impatience and faithful sample generation.
