Finite Automata: Regular Expressions and Deterministic Finite Automaton

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 1 of 4

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

From Regular Expressions to Automata

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

Regular Expressions (Recap)

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

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.

Spelling Error Correction

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

Finite Automata: Recap

Covers the fundamentals of finite automata and formal languages.

Finite State Machines: Basics and Design

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

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.