Finite Automata: BasicsIntroduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
From Regular Expressions to AutomataExplores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Context-Free GrammarsCovers context-free grammars, their equivalence to pushdown automata, and the hierarchy of grammar types.
Universal Source CodingCovers the Lempel-Ziv universal coding algorithm and invertible finite state machines in information theory.
Birth and Death ChainsExplores transience and recurrence in Markov chains, emphasizing birth and death chains and random walks.
