Video 11 - Dead State in DFA | Strings Not containing 3 consecutive b | TOC Masterclass | Sridhar Iyer

Hello Viewers ,


Welcome to this brand new playlist on Theory of Computation(TOC) / Automata Theory.

In this video we are going to solve a problem based on creating an DFA not containing 3 consecutive b's.

You can also watch my previous playlist on the Lecture Series on the same subject.
   • Finite State Machines Explained  | Le...  

In this Masterclass I will be taking up more complex and challenging problems and also discuss the applications of the subject in various areas.



So without wasting much time, lets get started.

My Other Related Videos:

1) Introduction to Theory of Computation -    • Introduction to Course on  Automata T...  
2) TOC Complete Lecture Series -    • Finite State Machines Explained  | Le...  
3) Cryptography and System Security Playlist -    • Goals of Security | Cryptography and ...  

Search Keywords:

trap state in dfa
trap state automata
trap state in dfa examples
what is theory of computation
TOC
TOC Theory of Computation
TOC Lectures
TOC Playlist
theory of automata
Automata Theory
theory of computation gate
finite automata
dead state kya hota hai
what is a dead state
trap state vs dead state


#sridhariyer #toc #Theoryofcomputation #tcs #automatatheory