TOC Lec 08 - NFA to DFA lazy method by Deeba kannan

preview_player
Показать описание
TOC Lec 08 - Non Deterministic Finite Automata to Deterministic Finite Automata conversion easy way by Deeba Kannan
Рекомендации по теме
Комментарии
Автор

Let me take a moment to thank you Deeba...
♥️♥️♥️♥️♥️ Thanks a I was struggling with the book since a week.. and later I saw other channel's videos which were also lacking approach and quiet uninteresting... With only 4 days being left and me going various other videos and not finding the right content, I thought your videos would also be the same.. Frankly I have seen the thumbnails in my search results, but Idk y I never really went on to play any video of yours... Lost hope and very stressed, I didn't really knw what to do... Some how with 3 days left.. I came back looking for content on YouTube as I was pretty sure I wasn't going to get anything out of the book... To my awesome luck, I had played one video of yours.. and to add to more awesomeness, there was a full playlist of imp topics of the subject explained in a simple, lucid and minimalistic approach... I have written my exam very well today.. the reason behind is you Deeba... The moment I came out of the exam hall, that instant itself I thanked you ovr a hundred times in my mind...
Thanks a lott♥️♥️ Kudos to the good work you're doing... Please ask you're subscribers to share the videos.. This good work of yours must reach out to more eyes..
God bless you Deeba..
Lots of love
Thank you once again ♥️

Rao
Автор

This was amazing! Seeing this was great! Thank you so much!

martinbolz
Автор

Mam if 2 final states come how we can do?

albinkmathew