Deterministic Finite Automata (Example 3)

TOC: An Example of DFA which accepts all the strings over {a,b} that does not contain the string 'aabb' in it.
This lecture shows how to construct a DFA that accepts all strings over {a,b} that does not contain the string 'aabb' and contains all other strings.

Music:
Axol x Alex Skrindo - You [NCS Release]

#TheoryOfComputation #TOCByNeso #DeterministicFiniteAutomata #DFA #AutomataTheory

[alexwilson]

I'm proud of you. Single handedly saving students that have poor professors.

[zeal]

This may help :
q1: Why C gets a self loop ?
A1: Before C we have got our "aa" as required in "aabb", so any further a's do not disrupt our required sequence of "aabb" that is we cud still have "aaaa..ab" and still it will be valid since we got 2 a's in conjunction preceeding our b.

q2: If C got a self loop, Why did we loop D to B and not create a self loop for it as well?
A2: Before D we have got our "aab" as required in "aabb". If we create a self loop for D, we have end up with "aaba" which does not match our required string. In order to only get a "b" after "aab" we must go to the start (that is where our sequence started to form) since it will make our string "aaab" which is still valid and hope that when it reaches again to D we are getting input as "b".

[oskarkamil]

You're doing exceptional work. You're helping massive number of students pass their studies. Keep up the good work 🏆

[manasaggrawal]

A lot of confusion is going on here but i think this will help: "it's not the string 'aabb' that u have to achieve. It can be 'aaabbaa' or 'aabbaba' or any other string as long as it contains 'aabb' in it and the rest of the string can consist of any pattern.

[Danger]

I like how you give us multiple examples to work with, makes learning so easier!

[skandeshkkblr]

i dont think there will be better explanations than this .. thanks a lot for such amazing content !

[JcMorgan]

You did very well sir, the explanation was very clear. I cannot thank you enough 🙏

[shardul]

You're an absolute genius sir, you saved my dreadful exams with the help of your absolutely amazing teaching! Thank you so much!

[NiveshPatil]

that is brilliant <3 thank you for being one of the best teachers out there.

[starmakerspro]

If there is an award like oscar in studies this man truly deserves 🙏🙏

[xingxanghanji]

It got from D to B for in put 'a' because after getting to B if we have another 'a' then our required string becomes "aa" when it reaches C and then the same process can continue again.If there had been a 'b' after jumping from D to B then it would go to A to start the whole process again as out string then would be "ab" and not "aa".

[saitcam]

Sir but 11:06, D state can return to C state, it is not necessary to retun to B, because in C state there are two "a" transition already

[leroypalmer]

This is a powerful example. I like question like these. These make sure you understand the concept. Thank you

[scottzeta]

I am starting a similar course in Uni. My lecture said solution might easy to understand but hard to figure it out. I guess now I knew what does that mean.

[averbath]

Thank you for providing such great content to help us learn properly. The example is pretty good and pretty perfect to use the flip technique to solve the problem. The explanation is pretty clear as well. Great job! And Thank you again!

[ahmadmohamad]

i missed my first three lectures and i was lost but thank god i found you you life save

[souvikdatta]

Awesome explanation sir! I recommend all my friends to watch your tutorials

[nazirahassan]

got an exam tomorrow, thanks for the explanation really helpful!

[nikhielsingh]

exceptionally good teaching, I am a final year student at University of Kwa Zulu Natal in South Africa and your videos help me a lot, thanks

[PradeepBodduru]

Sir, did anyone forced the faculty to design these kind of subjects?