Lecture
Regular Expressions (Recap)
Description
This lecture covers the fundamentals of regular expressions, including finite automata, the pumping lemma, and exercises on defining languages with regular expressions. It also delves into examples and proofs related to regular languages.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related lectures (47)
Finite Automata: Basics
Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
Finite Automata: Recap
Covers the fundamentals of finite automata and formal languages.
Automata Theory: Basics and Theorems
Introduces the basics of automata theory and explores the theorems of regular languages.
Problems and Languages: Regular Languages
Covers regular languages, encoding, alphabets, words, languages, concatenation, exponentiation, and iterative closure.
Context-Free Grammars
Covers context-free grammars, their equivalence to pushdown automata, and the hierarchy of grammar types.