Deterministic Finite Automata(DFA) with (Type :Substring problems)examples

This is the fourth video of the new video series "Theoretical Computer Science(TCS)" guys :) Hope you guys get a clear understanding of this subject Thank you guys for watching. If you liked it please leave a comment below it really helps to keep m going!:)