Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the basics of finite automata, including deterministic and non-deterministic finite automata, regular expressions, formal definitions, acceptance criteria, and derivability. The instructor explains the concepts step by step, providing examples and clarifications.