Lecture
Finite Automata: Recap and Determinization
Related lectures (33)
Universal Source Coding
Covers the Lempel-Ziv universal coding algorithm and invertible finite state machines in information theory.
WS1S Solver: Project Structure
Explores the project structure for solving WS1S formulas and planned additions.
Lexicons, n-grams and Language Models
Explores lexicons, n-grams, and language models, emphasizing their importance in recognizing words and the effectiveness of n-grams for various tasks.
Regular Expressions to Automata
Explores the conversion of regular expressions to automata for efficient character classification.
Logic Systems: Finite State Machines
Explores Boolean algebra, optimization, sequential systems, and finite state machines design.
Deterministic Pushdown Automata
Covers deterministic pushdown automata and their use in language recognition.
Regular Expressions and Lexer Idea
Covers regular expressions, Kleene's contributions, logic, lexical analysis, and manual lexer construction.
FSM Design and Synthesis
Explains the steps in FSM design, including transition and code table creation.
Birth and Death Chains
Explores transience and recurrence in Markov chains, emphasizing birth and death chains and random walks.
Regular Expressions and Lexer Idea
Explores regular expressions, including their history, operators, lexical analysis, and manual construction of lexers.