UCLA Olga Radko Endowed Math Circle

1/29/2023 -- Advanced 2: Deterministic finite automata

A DFA is defined as an abstract mathematical concept, but is often implemented in hardware and software for solving various specific problems, such as lexical analysis and pattern matching. For example, a DFA can model software that decides whether or not online user input such as email addresses is syntactically valid.
We will practice coming up with DFAs for different word problems and study their properties.