Lectures related to From Regular Expressions to Automata

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

Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.

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.

Automata Theory: Basics and Theorems

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

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.

Finite Automata: Recap

Covers the fundamentals of finite automata and formal languages.

Context-Free Grammars

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

Regular Expressions to Automata

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

Constructing a Lexer: First Symbols

Covers the computation of 'nullable' and 'first' for regular expressions.

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.

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

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

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.

Logic Systems: Finite State Machines Log in to Mediaspace to watch this video

Explores Boolean algebra, optimization, sequential systems, and finite state machines design.

Logic Systems: Sequential and Combinatorial Circuits Log in to Mediaspace to watch this video

Covers fundamental concepts of logic systems, including sequential and combinatorial circuits, state diagrams, and finite state machines.