Lectures related to Weighted automaton

Covers a recap on NFAs and introduces the determinization process.

Covers the conversion from finite automata to regular expressions and exercises on constructing deterministic finite automata.

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

Explores Boolean algebra, optimization, sequential systems, and finite state machines design.

Explores the conversion of regular expressions to automata for efficient character classification.