Lectures related to Unambiguous finite automaton

Explores the project structure for solving WS1S formulas and planned additions.

Covers a recap on NFAs and introduces the determinization process.

Covers context-free grammars, their equivalence to pushdown automata, and the hierarchy of grammar types.

Covers regular expressions, Kleene's contributions, logic, lexical analysis, and manual lexer construction.

Explores regular expressions, including their history, operators, lexical analysis, and manual construction of lexers.

Discusses the sharp transition in mixing time of a random walk.