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 expressive power of automata, limitations of regular languages, pumping lemma, and the transition from finite state automata to context-free grammars. It introduces context-free grammars, parse trees, grammar derivation, and provides examples of balanced parentheses grammars.