University of California, Los Angeles COM SCI 181
Dr Jaffe · University of California, Los Angeles COM · 2 lectures with notes
Every lecture with its full transcript and chapters, and one search across all 2 lectures.
CS 181 Lecture 7 -- Fall 2026, UCLA
NFAs simplify automata constructions, but subset tracking shows they compute exactly the same languages as DFAs.
CS 181 Lecture 8 -- Fall 2026, UCLA
Subset construction makes every NFA equivalent to a DFA, while KMP uses a pattern-specific DFA for linear-time string matching.