Related lectures (15)
Coin Rendering: Part 1MOOC: Information, Calcul, Communication: Introduction à la pensée informatique
Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.
From Regular Expressions to Automata
Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Early Modern Technical Drawings
Delves into the experimental history of science through early modern technical drawings, focusing on Leonardo's programmable automaton and lion.
Introduction to Grammars
Introduces automata, regular languages limitations, context-free grammars, and balanced parentheses grammars.
Stream Ciphers: Buteforce Inversion Algorithms
Explores stream ciphers, buteforce inversion algorithms, key recovery games, and attacks in cryptography.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.