Regular Expression to Finite Automata in Hindi | TOC | Automata | By- Harendra Sharma
HTML-код
- Опубликовано: 19 сен 2024
- How to convert regular expression to finite automata with examples
Regular Expression to Finite Automata in hindi
For more videos
Subscribe
Bhai Bhai Tutorials
By- Harendra Sharma
Thanks alot sir i searched for a long time finally i got it from your video
ruclips.net/video/nlfj1mtY3Bk/видео.html
It is so helpfull....thankyou sir.
sir i am impressed with you way of teaching
thankyou sir
Bde pyar se smjhaya aapne...😍😇
Nicely expressed, thank you sir
Thank you sir for your valuable information
#IndiagateLectureByNandaniSharma
best explination.
Thank you sir ♥️
Best explanation
Thank you so much sir
Thank you sir
nice expln
Sir at 15:01 example how can we solve it without using epsilon nfa
Thanks sir
Sir 🙏🏻👌
Care must be taken not to go out of one state of an alphabet multiple times
Be careful
(ab)*+(a+ab)*b*
Wrongly drawn
19:00 this solution might be wrong because the REGULAR EXPRESSION is having * over the whole expression.
so INITIAL AND FINAL STAGE MUST BE SAME. which is not in your answer.
please correct me
There is 'a' in between the expression
Please check the expression once more..
Very nice explanation but TOC is very difficult subject
Excellent explanation....very very helpful
no
help with this (10*)*
(a+b)*=a*(ba*)*
Thank you sir
Tq sir