TAFL29:Theory of Automata,Pumping Lemma for Regular Expression Examples Regularity of Languages

[@brahmang6587]

I think you are the best teacher for those subjects you are teaching... thankkkkks alot❤❤

[@hariomtripathi5322]

Thank u sir ...main poora lecture aapse hi padha aur aaj full marks ka paper karke aaya hun...great sir

[@UniversityAcademy]

Very good plz promote my channel among your friend circle🙏👍

[@thakurkshitijsingh]

Thank you sir I

[@thakurkshitijsingh]

​@@UniversityAcademyyes sir

[@Er.rahulsingh]

lots of thanks to uh sir

[@UniversityAcademy]

All the best

[@prashantchauhan7229]

sir apna camera sahi kariyee pleasee request

[@shashidevsharma3264]

Sir jo aapne 3:07 pe kiya hai. Agr wahan aa aayega to possibility hai ki accept na ho.

[@sudheemadhav]

If the question is asked that given language is regular or not Which one we have to use sir

[@ahsankhan-md9yk]

Sir last question me toh other string bhi accept ho jayengi jaise 11000 ya 11001 jo ki question ke condition ko follow nhin kar rhi .. toh yeh machine galat nhin hogi ?

[@UniversityAcademy]

Here we are only checking the regularity of language given hence we can. but if question is to design of DFA or NFA then we have to improve our machine

[@ahsankhan-md9yk]

@@UniversityAcademy can you tell me that how to make that improved finite automaton

[@RV26official]

Sir, formal langauge ka bhi video upload kar dijiye