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

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

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

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 ❤

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

Thank you so much ❤🎉

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

Thank you madam

Good

How about. (aaa)*

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

2 nd last step not clear

a*b*

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