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 introduces the concept of formal languages over an alphabet, including finite and infinite languages with specific patterns. It covers operations like union, intersection, and concatenation of languages, along with language exponentiation. The lecture also explores the representation of languages in programs and the Kleene star operation, providing examples and theorems.