Lectures related to Finite Automata: Basics

Covers the fundamentals of regular expressions and includes exercises on defining languages.

Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.

Automata Theory: Basics and Theorems

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

Context-Free Grammars

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

Finite Automata: Recap

Covers the fundamentals of finite automata and formal languages.

Finite Automata: Regular Expressions and Deterministic Finite Automaton

Covers the conversion from finite automata to regular expressions and exercises on constructing deterministic finite automata.

Finite Automata: DFA to Regular Expression

Explains the transformation from a DFA to a Regular Expression and discusses important concepts in automata theory.

Finite Automata: Recap and Determinization

Covers a recap on NFAs and introduces the determinization process.

Regular Expressions and Lexer Idea

Explores regular expressions, including their history, operators, lexical analysis, and manual construction of lexers.

Regular Expressions and Lexer Idea

Covers regular expressions, Kleene's contributions, logic, lexical analysis, and manual lexer construction.

Deterministic Pushdown Automata

Covers deterministic pushdown automata and their use in language recognition.

Regular Expressions to Automata

Explores the conversion of regular expressions to automata for efficient character classification.

Problems and Languages: Regular Languages

Covers regular languages, encoding, alphabets, words, languages, concatenation, exponentiation, and iterative closure.

Birth and Death Chains

Explores transience and recurrence in Markov chains, emphasizing birth and death chains and random walks.

Universal Source Coding

Covers the Lempel-Ziv universal coding algorithm and invertible finite state machines in information theory.

Software Disasters and Successes: Verification Impact and Transition Systems

Explores software verification impact, disasters, successes, and transition systems.

Spelling Error Correction Log in to Mediaspace to watch this video

Explores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.

Lexicons, n-grams and Language Models Log in to Mediaspace to watch this video

Explores lexicons, n-grams, and language models, emphasizing their importance in recognizing words and the effectiveness of n-grams for various tasks.

Finite State Machines: Basics and Design Log in to Mediaspace to watch this video

Introduces finite state machines, covering basics, design, and practical applications like decoders and encoders.

WS1S Solver: Project Structure Log in to Mediaspace to watch this video

Explores the project structure for solving WS1S formulas and planned additions.