Размер видео: 1280 X 720853 X 480640 X 360
Показать панель управления
Автовоспроизведение
Автоповтор
Watching this from my exam hall
R u watching it from u sem exams
legend
Thank you ma'am..., after watching your vedios for reference I passed my semester exam... once again thank you ma'am....
Thank you very much!And yes, your voice is really sweet! :):)
there is direct method to convert regular expression to DFA taught under the topic of compiler design
I'm in 5th sem so no compiler design for us
Here we came for Thompson algorithm
can u share the link
There could be a faster way of converting RE to DFA by first converting RE to NFA and then NFA to DFA. This way we are able to solve the question under 2 minutes.
Thanks namrata
Explain slowly and ur unbelievable 🔥
thank you mam...🤗🤗I watch you video and easy to pass on current Sem...mam tq..
osom....thank you very much....u made my whole day...
Thank you so much mam ...😊
Good beta😁😁😁
Thanks a lot 🤗
This video helped me a lot🤩
Thank you mam:)Can you please upload addition of two numbers in Turing machine.
Thank You so much mam it was really helfull
construct dfa for the regular expression (a+b)*abb can u solve this
Thanks a lot!
Helpful video mam thank you🙂
Nice Explanation !
Thankyou maam
Thanks mam
MAny thanks for the good job. Please can you do a video on conversion of regular expression to context free grammar. Please help us dear
Ur voice is nice
Very nice
Nandri ✌
Mam for a/b ?
If we get e closure(1u2) then how we have to do please reply
Closhur
How i contact you mam
Mail me: kcdeeba.cse@gmail.com
Can u say the ans( (0+1)*)*
Would you please slow down your speaking so we can understand clearer? Thanks so much!
Use the speed control feature of youtube...
John Smith Curious as to know if u do have the 0.5x speed option on ur u tube window !!
I m listening at 1.5x 😂😂
Watching this from my exam hall
R u watching it from u sem exams
legend
Thank you ma'am..., after watching your vedios for reference I passed my semester exam... once again thank you ma'am....
Thank you very much!
And yes, your voice is really sweet! :):)
there is direct method to convert regular expression to DFA taught under the topic of compiler design
I'm in 5th sem so no compiler design for us
Here we came for Thompson algorithm
can u share the link
There could be a faster way of converting RE to DFA by first converting RE to NFA and then NFA to DFA. This way we are able to solve the question under 2 minutes.
Thanks namrata
Explain slowly and ur unbelievable 🔥
thank you mam...🤗🤗I watch you video and easy to pass on current Sem...mam tq..
osom....thank you very much....u made my whole day...
Thank you so much mam ...😊
Good beta😁😁😁
Thanks a lot 🤗
This video helped me a lot🤩
Thank you mam:)
Can you please upload addition of two numbers in Turing machine.
Thank You so much mam it was really helfull
construct dfa for the regular expression (a+b)*abb can u solve this
Thanks a lot!
Helpful video mam thank you🙂
Nice Explanation !
Thankyou maam
Thanks mam
MAny thanks for the good job. Please can you do a video on conversion of regular expression to context free grammar. Please help us dear
Ur voice is nice
Very nice
Nandri ✌
Mam for a/b ?
If we get e closure(1u2) then how we have to do please reply
Closhur
How i contact you mam
Mail me: kcdeeba.cse@gmail.com
Can u say the ans( (0+1)*)*
Would you please slow down your speaking so we can understand clearer? Thanks so much!
Use the speed control feature of youtube...
John Smith Curious as to know if u do have the 0.5x speed option on ur u tube window !!
I m listening at 1.5x 😂😂