Learn How to Design and Build a DFA | COMS W3261 Lecture 1
Discover the fundamentals of designing and constructing a Deterministic Finite Automaton (DFA) in this essential lecture for Computer Science Theory students at Columbia University. Perfect for beginners! 🚀
Tim Randolph
2.1K views • May 22, 2022
About this video
This is Example 1: Designing and Building a DFA, a companion video for lecture 1 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 Preparation
4:00 Building the DFA
7:12 Testing the DFA
Course website: https://twrand.github.io/3261-sum22.html
Video notes: https://twrand.github.io/pdfs/notability/COMSW3261_sum22_Ex1.pdf
0:00 Preparation
4:00 Building the DFA
7:12 Testing the DFA
Course website: https://twrand.github.io/3261-sum22.html
Video notes: https://twrand.github.io/pdfs/notability/COMSW3261_sum22_Ex1.pdf
Video Information
Views
2.1K
Likes
22
Duration
14:04
Published
May 22, 2022
User Reviews
4.3
(2) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
No specific trending topics match this video yet.
Explore All Trends