Quick Guide to Strings, Languages, and DFAs in CS Theory β‘
Explore the essentials of strings, formal languages, and deterministic finite automata (DFAs) with this concise review, perfect for mastering Lecture 1 of Columbia's CS Theory course.
Tim Randolph
923 views β’ May 22, 2022
About this video
This is Lightning Review 1: Strings, Languages, DFAs, 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.
(Some of the audio isn't great on this one - I'll try to speak into the mic more consistently in future videos.)
0:00 Alphabets, Strings, and Languages
5:48 DFA State Diagrams
9:11 Checking/Evaluating State Diagrams
12:24 Formal Definition of a DFA
Course website: https://twrand.github.io/3261-sum22.html
Video notes: https://twrand.github.io/pdfs/notability/COMSW3261_sum22_LR1.pdf
(Some of the audio isn't great on this one - I'll try to speak into the mic more consistently in future videos.)
0:00 Alphabets, Strings, and Languages
5:48 DFA State Diagrams
9:11 Checking/Evaluating State Diagrams
12:24 Formal Definition of a DFA
Course website: https://twrand.github.io/3261-sum22.html
Video notes: https://twrand.github.io/pdfs/notability/COMSW3261_sum22_LR1.pdf
Video Information
Views
923
Likes
9
Duration
17:12
Published
May 22, 2022
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now