Wow. wow...wooww.. what a great quality of explanation.. Trust me it is best video available on turning machine problem. I have a suggestion please continue uploading more and more videos. you have good teaching quality..
@deebakannan
7 жыл бұрын
Thanks a lot
@mvgamers0835
7 жыл бұрын
Really Good U r GOD!! for me...!
@RaviTeja-qt6iv
6 жыл бұрын
lol
@vikyaths6277
4 жыл бұрын
Also watch neso academy videos...
@findingkelly
Жыл бұрын
@@deebakannan Outstanding quality. I hope you got some $$$ out of this.
@AmmarAhmey
6 жыл бұрын
Thankyouuuuuuuuuuuuu Very Very Very Much :) These 17 minutes of explanation are much much better than my 5 University lectures and hours of headache :D completely understood.
@prateeksholapurkar6190
7 жыл бұрын
I was struggling with turing machines untill i saw this... best tutorial so far in turing machines..
@NaveenKumarErroju
5 жыл бұрын
If you are impatient like me keep it in 1.5 play speed.. and relax
@abhishikthveligandula9527
4 жыл бұрын
Exactly bro
@jakobjensen7032
3 жыл бұрын
@Naveen kumar You forgot to say "okei"
@miracle.x1638
3 жыл бұрын
Here Iam using 2* 😬
@travisbates5539
7 жыл бұрын
Great job. You were clear in explaining the process. Keep up the good work!
@Rao6969
4 жыл бұрын
Lovely Explaination. Believe me I watched 5 other Tutorials on Tûring Machine prior to this but vere not very clear like this one. This is one stop destination for lucid turing machine tutorial. Thank you so much Deeba
@qc7511
4 жыл бұрын
Oh god, this video truly saved me. I couldn't grasp this subject at all but luckily found this video out. Clear and easy explanation, great work! Thank you teacher! Cheers
@kunalkrsna
5 жыл бұрын
Perfect Video and Easy to understand... Loved the Way you Say “Power of n” mam 👌🏻😍 replayed it more than 10 times when you say this ❤️ Thank You for Such Useful and Interesting video 🙏🏻
@raihanhafiz1221
5 жыл бұрын
Great explanation mam thanks. you're 100 time better explain than my teacher. 🙏🙏
@atmaja_cooks
5 жыл бұрын
This is explained in such a precise manner. Couldn't have seen any better. Thank you. 🙌🙌
@ya6655
7 жыл бұрын
Her language L = { OK?^n | n >= 1000000000 }
@nathanielabraham6156
4 жыл бұрын
Lmao this is funny. But I appreciate her help too much to even notice.
@kallasuribabu3873
4 жыл бұрын
Really mam yr explanation and way of teaching is simple superb.Your saying line to line in TM diagram that is awesome.tq mam to upload this video.
@Anytime4yo
7 жыл бұрын
mam,the way u teach the TM is osome
@hmingsanglianahauhnar6641
7 жыл бұрын
The best explanation that i have ever seen in turing machine.... thanks...
@arpitgarg3268
7 жыл бұрын
thank you so much you saved my semester exams
@chetanbhargav8586
6 жыл бұрын
Mam Good job, u have saved my internal marks. U have good subject in u r hands, wish u to upload more videos. Thx once again (2018).
@Youngboy207
7 жыл бұрын
I have an exam in 4 days, your videos are very helpful. Thank you from Texas :)
@abdallaelmedani8117
7 жыл бұрын
Thank you, you've explained it very well.
@groutgrout9833
4 жыл бұрын
Thank you for the video, very clear explanation and pleasant narration!
@matamdeepthi853
5 жыл бұрын
good quality of explanation for every and each part of the problemm and nice clarity also
@shivprakashsharma9511
6 жыл бұрын
Wow , explanation way is amazing !!
@swathicreations9263
5 жыл бұрын
Nice video mam. The way of explanation is so nice. Thank u so much mam.
@w1ck3l
6 жыл бұрын
You're a hero to many. Thank you for this.
@aishreddy7591
5 жыл бұрын
Thank you so much madam.now I find it easier to solve problems...thq so much for the clarity 😊😊
@manojkiran4217
7 жыл бұрын
really an awesome explanation
@marialuizep.7872
5 жыл бұрын
Thank you so much for your explanation, helped me a lot to understand TM
@Prophetelf
7 жыл бұрын
This is a really good video, thanks for doing this!
@rayansoban7877
7 жыл бұрын
Beautiful algorithm! Keep up the good work :)
@namitayadav3725
7 жыл бұрын
thanku.mam..dis is d first tym that hs make me to understand.Turing machine prblm..best video I ever see
@nataliaregina5458
6 жыл бұрын
Perfect explanation! Thank you!
@aryanvishwakarma8297
2 жыл бұрын
One of best video that I found
@saharfatima215
7 жыл бұрын
These TM explanation is really so good Kindly share more tutorials on TM
@usatech1179
4 жыл бұрын
Awesome mam a complete explanation best explanation available for T M in utube is this one u r at the level of IIT proff to mam
@hardikharsora7332
7 жыл бұрын
simple n grt explanation ... Mam .. last day did this problem I understood ... thank you so much 👍👍
@nilayshah6967
5 жыл бұрын
Mam your explanation helped me a lot Thank u so much
@aaqibhaque7194
7 жыл бұрын
mere bharat maahan aap jaise teacher k liye ..joog joog jiyo aap...dua Bangladesh se.
@prashantakabari5479
7 жыл бұрын
Really good technical explanation. after seeing this all the concept is clear
@amitdas4402
7 жыл бұрын
best explanation on this topic found so far.
@shalinikannan3716
6 жыл бұрын
Thanku sis.. Understood morr than 50%.. N I'll watch again to clear my concepts😊😊😘😘
@deepkumar7823
4 жыл бұрын
best explanation ever mam I will see many videos but i am not able to understand what is the actual concept is now i will understand it
@fadedlife2013
7 жыл бұрын
Best explanation on here. Thank you.
@sriharsharevadi6908
5 жыл бұрын
Thank you so much now I have a clarity about turing machine tqq
@prasannakumar6008
7 жыл бұрын
This was an excellent explanation of TM. This allowed me to solve all similar examples in my book. Surprised this video doesn't have more views. Good quality and nice audio. I would suggest using a board instead of a paper. Nonetheless, stupendous job.
@pramukbhargav8592
7 жыл бұрын
NICELY EXPLAINED BY YOU THAN NIE MYSORE
@mithunkrishna2135
6 жыл бұрын
awesome mam,,'great quality of explanation..
@TheUserOficial
4 жыл бұрын
I wish my teachers were just as good as you are, thank you so much!!
@games_den
7 жыл бұрын
deeba the saviour in battlefield of end sem exam.. thanks!!
@teus1500
7 жыл бұрын
Hello! How can I do this same thing but with a multi tape machine? Excellent explanation. Thank you!
@santhoshitalks7944
6 жыл бұрын
Thank u mam...for giving a clear view about turing machines..
@ayenewhailu7431
5 жыл бұрын
one of the most and famose person in the world teacher to help with out teacher to student tanks your effert and ablite good bay
@sirishagondi9524
5 жыл бұрын
Mam so nice to understand this video thanks for uploading
@akashkatam4251
7 жыл бұрын
Thankyou Soo..much Mam !!!! got a clear idea of the Concept.
@antisociata
7 жыл бұрын
I finally understood TM. thx you. excellent video.
@saranyadoredla1162
2 жыл бұрын
Thank you so much for your clear explanation 🥰 it is very helpful for my exam time 😊 wonderful very nyc explanation mam...... once again thank you so much mam......👌👏👏
@UdayKumar-ll9ow
4 жыл бұрын
very good explanation ,thanks a lot madam for this one:)
@harsha7001
6 жыл бұрын
Tq...Mam awesome explanation wonderful teaching
@adityachettri4395
6 жыл бұрын
Thank you so much for clearing my concept.mam
@garykildall4111
7 жыл бұрын
Thank you, very clearly explained!
@yashas21
7 жыл бұрын
thanks a lot mam! explanation was perfect!
@viraj_singh
7 жыл бұрын
I was reminded of my south Indian teacher who has the same accent and style of teaching.
@siddharthakille6841
7 жыл бұрын
what happens in the case where a^10 b^3 c^3. It stays at q1!! does that mean rejection or is that an error in machine? thanks
@harshithaks5846
6 жыл бұрын
Thanks mam its really help me a lot for tomorrow's exams
@manthirakrish2316
6 жыл бұрын
Thanks for this valuable video!
@nishatsayyed8326
7 жыл бұрын
why dont we check the condition for Z in the state q4?? like we made a transition from q0 to q4 while checking for the character Y... isn't it necessary that we should go to a new state and check if we get a Z at the state q4?...why is that self loop for Z in the state q4? anyone can answer?
@AmoghGupta12
6 жыл бұрын
We can have a new state q5 and then go to the acceptance state as per your suggestion. But what I understood was, after reaching q4, it doesn't matter if it is either y or z. (WE JUST DON'T WANT OTHER SYMBOLS). This solution is acceptable because we have initially taken care that z will appear only after y. For a clear solution adding one more state(q5) is better I guess.
@fadoag
2 жыл бұрын
Please it is possible the tape head is initially placed at the right most input symbol in the cell ?. Or it must always be the leftmost
@SouravMondal-iu4zw
6 жыл бұрын
good explanation i got clear information about your video
@shivamparashar641
7 жыл бұрын
Thank you so much for Educating us.
@georgesnkeuna6929
4 жыл бұрын
Thank you so much for the explanation. i have new skill in TM
@NR_Tutorials
7 жыл бұрын
nicely explained thanku miss 💪💪
@fugvutfuttvugf5ftuf39
5 жыл бұрын
good explanation. Thank you!
@OutCider937
7 жыл бұрын
YOU DA MAN, DEEBA.
@nishmithashetty9568
5 жыл бұрын
Loved ur explanation
@CSEconceptswithParinita
4 жыл бұрын
Thank you so much ma'am! You're an inspiration for new tutors like me🙏💙💙💙
@deebakannan
4 жыл бұрын
Thank you so much dear. All the very best ..
@CSEconceptswithParinita
4 жыл бұрын
@@deebakannan thanks a lot. It matters😇
@nikhiljkenneth3044
2 жыл бұрын
shouldnt the last transition(q4 to acceptance state ) transition be b->b,L so that to be accepted?
@feritall
6 жыл бұрын
Great video! Shouldn’t we also check in q0 for “b” or “c”? That would also go to the reject state.
@NaveenKumarErroju
5 жыл бұрын
Watching tutorials for one hour. They all confused me more.. this video explaned pin to pin
@ailoveu100
7 жыл бұрын
great explanation mam.. gbu..
@AyushPandeyMusic
7 жыл бұрын
wow ! Mam,really thankful to you ! exam tomorrow !! Thank u so much!!
@nilslorand
4 жыл бұрын
very helpful, thank you
@Geetaupdeshbyai
7 жыл бұрын
thanks mam.. excellent explanation
@shanumalvi4382
7 жыл бұрын
madam how we make the transition table of this string..
@ayanavnambiar
3 жыл бұрын
Thank you so much mam.. Which is easy to understand😍
@musical_nights
6 жыл бұрын
Great Explanation!!
@astolat2262
4 жыл бұрын
Thanks it was very helpful
@nerdleituras2242
6 жыл бұрын
Gracias, one subscriber
@desalewyismaw8781
4 жыл бұрын
thank you for your presentation
@piyushmeshram23
7 жыл бұрын
Very nicely explained...Mam please make more videos on turing machine problems
@brunaguterres1817
5 жыл бұрын
Great video! Thank you very much
@sonfromheaven
6 жыл бұрын
The strings that will be accepted by language L = {0^3^n+1 : n ≥ 0}, if n = (0,1,2) how to solve above problem.
@yossef619
6 жыл бұрын
amazing video , thank you very much.
@waywithirfan826
7 жыл бұрын
way of teaching is very nice
@hamzatahseenmughal5829
6 жыл бұрын
mam you tutorial made me clear in some problems buti have tree questions of turing machine mam if you could explained me how to solve this so i will be very grateful to you
@subbareddyd544
5 жыл бұрын
Explained very clearly
@izeroskool
7 жыл бұрын
awesome explanation thanks
@himani895
7 жыл бұрын
mam can u upload video on enumerable , recursive and recursively enumerable..
Пікірлер: 245