Ma'am please reply I have exam on tomorrow Can we do direct method without epsilon process ? By converting expression in to Direct NFA and then To DFA ? Will they give marks ?
Read the question and then answer it. Create minimized DFA for the following regular expression. Then you can convert expression in to Direct NFA and then To DFA. but if the question is "Create direct minimized DFA for the following regular expression using minimization method" then u have use the above method only. Then only you will be getting marks.
If u get the final state number in multiple states, then all those states will be final ma. For example if the state 10 is the final state and if the new states are A, B, C, D,E and F. Among these new states if B, C, D and F contains the state 10 means then B, C, D and F will be the final states. As per the definition of FA, it containg single intial states and set of accepting states so any automata can have one or more final states. I hope u understand. Right Vishnu????
The way of delivering the content is awesome mam. I understood the concept very well and thank you for providing such a content to us.
Mam so great your teaching skills are, it is absolutely clear and hattsof to your patience🔥👏
Thank you so much mam ❤️
Thanx a lot. its my pleasure
Thank you so much ma'am. Lots of affection from assam
Thank you so much mam your teaching is a very nice for my useful
Thank you so much 🙏
great job mam it was the best video for this topic ever seen keep working thankyou
Excellent teaching mam keep rocking like this!!
Thanks alot for this lecture
Nandri mam 🙏,ungala la oru 12 mark pakava eluthune
Explanation is great. Thank you
mam final diagram see B to E you connect b it is wrong ..🙂🙂🙂.....
Awesome Explanation .
Thank You.
beautiful...thank you so muchh
Thankyou ma'am only legends are watching before one day of Exam 😂😂😂😂
one of the best explanation
Osm explanation mam❤
mam neega vanthu tamil very super mam nice explanation
Mam can you please tell how e nfa diagram comes for a|(BC)*
thank you ma'am
Thanks for ur explanation 🙏🙏
Thanx a lot
Thanks 🙏🏼
mam ey neenga kola mass uh
mam in minimized DFA state B on accepting symbol b goes to D
Ma'am please reply I have exam on tomorrow
Can we do direct method without epsilon process ? By converting expression in to Direct NFA and then To DFA ?
Will they give marks ?
Read the question and then answer it. Create minimized DFA for the following regular expression. Then you can convert expression in to Direct NFA and then To DFA. but if the question is "Create direct minimized DFA for the following regular expression using minimization method" then u have use the above method only. Then only you will be getting marks.
In last b,b is D but u connected to e
Ok
Wt if I got final state number in multiple states
If u get the final state number in multiple states, then all those states will be final ma. For example if the state 10 is the final state and if the new states are A, B, C, D,E and F. Among these new states if B, C, D and F contains the state 10 means then B, C, D and F will be the final states. As per the definition of FA, it containg single intial states and set of accepting states so any automata can have one or more final states. I hope u understand. Right Vishnu????
@@msdlearningworld7764
why move E,b is not 9 10 5
why move E,b is not 9 10 5 ,,,,