Finite Automata: Basics | EPFL Graph Search

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.

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

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

Covers the fundamentals of finite automata and formal languages.