The most fundamental string matching algorithm (introduction to Finite Automata)
Hello, today, we’ll discover some of the most fundamental ideas in Computer Science applied to string matching. Learning and knowing about finite state automata, deterministic and non-deterministic is fundamental if we want to be able to explore more advanced algorithms like the KMP algorithm, tries, suffix trees, Aho-Corasick, RegEx engines…
Previous video about the Boyer-Moore algorithm: • The algorithm behind Ctrl+F (Boyer-Moore S...
Playlist about string algo: • Characters & Strings
Source code: https://github.com/ComputerBread/algo...
Support me: https://ko-fi.com/computerbread
Cheatcheet/mindmap: https://ko-fi.com/s/34966c8fb1
Twitter: / computerbread
Subscribe: / @computerbread
2nd Channel: @computerbreadboard
Chapters
00:00 Introduction
00:49 Finite Automata Theory
02:00 DFA & NFA
03:38 Language
05:28 Matrix representation
05:55 Constructing a DFA (intuition)
10:20 JavaScript Implementation
13:05 Complexity
Piano piece to listen to while watching: • Chopin: Andante Spianato and Grande Polona...
Helpful resources:
Theory of Computation & Automata Theory by Neso Academy • Theory of Computation & Automata Theory
https://www.wild-inter.net/teaching/c...