Computer Science Theory Summer 2021: NFA Equivalence & Conversion Explained π₯οΈ
Dive into Lecture 2 (Part 3/3) of COMS W3261 at Columbia University, where we explore the proof that NFAs can be converted to DFAs and discuss their equivalence. Perfect for mastering automata theory!
Tim Randolph
482 views β’ Jun 30, 2021
About this video
This is Lecture 2 (Part 3/3) for COMS W3261: Computer Science Theory, offered Summer B 2021 at Columbia University.
In this lecture, we prove that NFAs recognize the set of regular languages. We do this by showing that for any NFA, we can create an equivalent DFA.
Course website: https://twrand.github.io/3261-sum21.html
Link to video notes: twrand.github.io/pdfs/notability/COMSW3261_Lecture2.3_notability.pdf
In this lecture, we prove that NFAs recognize the set of regular languages. We do this by showing that for any NFA, we can create an equivalent DFA.
Course website: https://twrand.github.io/3261-sum21.html
Link to video notes: twrand.github.io/pdfs/notability/COMSW3261_Lecture2.3_notability.pdf
Video Information
Views
482
Likes
5
Duration
21:43
Published
Jun 30, 2021