Lecture
From Regular Expressions to Automata
Related lectures (36)
Spelling Error Correction
Explores spelling error correction, including neologisms and borrowings, using edit distance and finite-state 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 (Recap)
Covers the fundamentals of regular expressions and includes exercises on defining languages.
Finite Automata: Basics
Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
WS1S Solver: Project Structure
Explores the project structure for solving WS1S formulas and planned additions.
Automata Theory: Basics and Theorems
Introduces the basics of automata theory and explores the theorems of regular 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.
Context-Free Grammars
Covers context-free grammars, their equivalence to pushdown automata, and the hierarchy of grammar types.
Finite State Machines: Basics and Design
Introduces finite state machines, covering basics, design, and practical applications like decoders and encoders.