Master the NFA to DFA Conversion Process | COMS W3261 Lecture 2
Learn step-by-step how to convert a Non-deterministic Finite Automaton (NFA) into a Deterministic Finite Automaton (DFA) in this essential tutorial for Computer Science Theory students at Columbia University. ๐
Tim Randolph
677 views โข May 23, 2022
About this video
This is Example 2: Converting an NFA to a DFA, a companion video for lecture 2 of COMS W3261: Computer Science Theory at Columbia University. This isn't a standalone video - it's designed to complement the course content.
0:00 Intro
0:20 The NFA
1:03 Formal definition of the NFA
2:49 Formal definition of the DFA
5:33 State diagram and transitions
Course website: https://twrand.github.io/3261-sum22.html
Video notes: https://twrand.github.io/pdfs/notability/COMSW3261_sum22_Ex2.pdf
0:00 Intro
0:20 The NFA
1:03 Formal definition of the NFA
2:49 Formal definition of the DFA
5:33 State diagram and transitions
Course website: https://twrand.github.io/3261-sum22.html
Video notes: https://twrand.github.io/pdfs/notability/COMSW3261_sum22_Ex2.pdf
Video Information
Views
677
Likes
4
Duration
13:39
Published
May 23, 2022
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now