Theory of computation :How to construct NFA for given Regular Expression | TOC| Lect39

[@sanikapubg568]

But mam you have to solve this question by RE- Epsilon NFA ??

[@jhambura1]

Thanks ma'am aaj exam hai or ye wala concept clear ni tha ab aa gya smjh achhe se aaj poore question krke aaunga😁🙏🙏

[@rajashri86]

Thank you so much . All the very best 👍

[@-A-B-I-N-A-T-H_A-S-A-R-I-Y-A-]

Oops I scared of this question when i saw it in previous year question papers but now this is look like nothing ... thanks a lot mam ❤

[@rajashri86]

Thank you 🙏

[@Zaheerh739]

Thank You Ma'am 😊
The doubt 🧐 is Cleared.

[@rajashri86]

Thank you 😌

[@sarcasticboy4507]

the first one you did was NFA . it was not dfa because for state C there is no defined transition for input a and b

[@VanshSharma-k4b]

yeah exactly and also there should be two separate final states for two different string definitions

[@JD-SANJEY]

Thank you so much ❤🎉

[@rajashri86]

Thank you so much 😊

[@itworld4285]

Thank you madam

[@rajashri86]

Thank you 😊

[@summitsummit2558]

Good

[@rajashri86]

Thank you ☺️

[@aasan6754]

i think in the third one "c" state will have null transition to it's both side.

[@dorcusmaphie8067]

How about. (aaa)*

[@akshat4773]

2 nd last step not clear

[@dorcusmaphie8067]

a*b*

[@-A-B-I-N-A-T-H_A-S-A-R-I-Y-A-]

Product of Complement a*.b* = Complement of Sum (a + b)* that is put a,b in a loop...

[@asrofficial1482]

madam plese dont make wrong thumbnil and wrong caption. you are totally teaching wrong concept