Incredible explanation, very minimalistic yet very robust method and very clean and clear drawing and writing! Definitely the best teacher of comp theory in the world! Thanks Sundeep!

Good explanation sir.....Very helpful for Students who r taking Semester Exams Now.......Very Simple and Easy Explanation.......ధన్యవాదాలు సార్

Excellent Explanation.🙏

its amazing sir i enjoying the automata. great work sir ,i have started watching video today and lets see when i fill left comment in the last video

sir is it possible for dfa that finall state may have 2 two inputs for same state ?

Fantastic explanation ❤

but the diagram was a NFA it has multiple path for other state . can you please explain

Great Explanation sir , Every topic became easy after watching each video..

Sir can u explain the problem The set of all strings such that each block of five consecutive symbols contains atleast two 0's where alphabet is 0,1

Nice video I learned more knowledge 😊

one doubt sir, shouldn't the number of states = number of input symbols + one which is no of states should be 3 ??? but ur solving with 2 states ???

Is there any other answer for the string starting with ab??

Awesome explain sir ❤ love you from Bihar ❤

Very clearly explained sir!

Sir as we Known DFA has only 1 transaction state, but u make 2 transactions from ( q1, 0 ) -> q1 & dead state. I think that's wrong. @14:00

Thank you it helps a lot

nice explaination sir😊

Sir.... shouldn't we use 1 on q1 instead of zero and dead state we will get 01 onle there @14:21

Good explanation sir

Sir why fa has only one initial state????

god gifted

amazing

Sir in the 2nd example q1 state has 2 0's as input then this is not dfa right?!

Tomorrow Internal still now I can't understand 🥴🙄

@14:21 what if we pass q1 to q0 when we get input 0 in q1?

Why can't we pass q1 to q0 with input 0?

14:16 not self loop in q1 bcz string start with 01. -q0--0-->q1--1-->q2

🎯 Key Takeaways for quick navigation: 00:32 🚀 *Constructing DFA for "Starts With 0" Problem* - The problem is to construct a DFA that accepts strings starting with the digit '0'. - The language L is defined as strings over the alphabet {0, 1} that start with '0'. - The minimum string length is 1, requiring two states for the DFA, with transitions for both '0' and '1'. A dead state is added to handle strings not starting with '0'. 11:08 🧩 *Constructing DFA for "Starts With 01" Problem* - The problem is to construct a DFA that accepts strings starting with the substring '01'. - The language L is defined as strings over the alphabet {0, 1} that start with '01'. - The minimum string length is 2, requiring three states for the DFA. A dead state is introduced to handle strings not starting with '01', ensuring all transitions are defined for every state and input symbol. Made with HARPA AI

Very difficult to understand 🙂

Is this DFA applicable in the industry??? Why we are learning this it's so hard to study no doubt your explain is so good but is it applicable anywhere !!! NO !!!

Good explanation sir