DFA for union, intersection, difference and complimentation of two dfas

preview_player
Показать описание
Here, two dfas have been constructed
1. accepts all strings containing 00 as sub-string
2. accepts all strings ending with 01
i. DFA to accept all strings which either contains 00 or ends with 01
ii. DFA for all strings which contain 00 and ends with 01.
iii. DFA for all strings which contain 00 but does not end with 01.
iv. DFA for all strings which ends with 01 but does not contain 00
v. DFA for all strings which neither contains 00 nor ends with 01.
have been shown.

link to my channel-

link to data structure and algorithm playlist -

link to information theory and coding techniques playlist -

link to compiler design playlist -

link to Formal Languages and Automata Theory-
Рекомендации по теме
Комментарии
Автор

I cant believe this amazing video exists. Thank you and God bless you sir. You are a gentleman, and a scholar.

daayemshehzad
Автор

Wow totally understood sir ...quite confused in class but here you made me all my concepts all clear ...nice video sir

abhijitgupta
Автор

Thanks for your valuable teaching sir ji🙏

rathodpavan
Автор

Thanks godddd! I was looking for this video content but couldn't find anywhere except your channel! It helped me a lottt

sonkez
Автор

Thank you very much this helped with a homework problem I was stuck on!

chrismuller
Автор

That's some good explanation. Thank you sir

Anshi-ot
Автор

thnx sir everything got cleared including my marks

CodeTech-kr
Автор

Thank you! Your tutorial is amazing! Now I understand this concept! Thank you very much!

Amy-moki
Автор

Thanks a lot for covering this topics!! Very helpful, great video sir.

akshayvats
Автор

I pay over a 1000 dollars for class and you for free did what my professor couldn't do with 3 classes

darkmush
Автор

Very well explained sir hats off to you 🙋 really it helped me a lot Thank u very much sir🙏🙏

luckysikera
Автор

Thank You very much sir . Totally got the concept.

digveshdessai
Автор

The best and easiest one so far. Thank you!

usless
Автор

Very decent. The handwriting is also clear, now I have to say my professor sucks.

zilinli
Автор

Sir your video's are very good but what about dead states sir do we need them for union, intersection and complement?

akhileshchukka
Автор

Very helpful video, thank you so much :))

dogatascilar
Автор

How to deal with dead State if one of them have it

akshaysangani
Автор

Nice work, excellent explanation, only one question, this union and concatenation method works only for complet DFA or you can use it when you have an incomplete dfa.
For example, AP goes to BQ because A going to B with 0 and P going to Q with 0, but, whats happen if A doesnt have any transition with 0, i mean, A only go to A with 1, what happen in that case? Where AP is going to?
Thank you.

Ledx