Paying a ridiculous amount of money for a "reputable UK university" while I have to watching this life save videos on UA-cam in order to keep the struggle alive. This man deserves the tuition fee really! When would this be implemented? UA-cam Bsc certification?
I was watching multiple videos and tried to learn from other channels, I felt like I was stupid, but after I came here at the first 2 minutes I realized the big picture and saw how easy is this, this means how much your channel is special, making things simple. Thanks.
Wow your english is pretty damn good, normally I have a hard time understanding the english pronunciations from the many different native countries that teach Computer Science but yours is pretty good and not boring or mono-tone at all which makes it very easy to listen to. The software you use to teach is also top notch, thank you my good sir!
3 hours before exam, every video in the playlist at 0.5x speed at the same time so you fully comprehend the material in the least amount of time. What do you do with the remaining time, you ask? Why, play more Overwatch, of course!
I watched several videos of toc from different channels... but i understand nothing..,.God showed me this channel and now I understand easily....i just wasted my time watching other channels.... thank you so much sir. Can you provide all videos according to the syllabus of UGC net
The summary of the video is, that the difference between deterministic finite automaton and the non deterministic finite automaton. So in deterministic automaton, there is a unique next state which has no choice of randomness and is simple and easy to design. They are multiple next states which can be achieved using or consuming one input or no input in that case, in that case it is called that input epsilon. So that's a brief overview and differentiation between deterministic finite automaton and non deterministic finite automaton.
Thank you for excellent educational material. I have one question regarding this video: Shouldn't the first statement be modified from "In DFA, given the current state we know what the next state will be." to ""In DFA, given the current state AND A GIVEN INPUT we know what the next state will be." ? Similarly I believe that the second statement should read as "Given a particular state and a given input, It has only one unique next state." Please confirm my understandig or correct me if I am wrong. Thanks in advance,
I got confused 😕 why it also transition on epsilon if it's not an epsilon - NFA. Came here to check what's those P{Q} set would be... But it left me more confused.
please can you explain to me in video like these video the relation between Regular Grammar Regular Languages turing machine FSM NFA i am lost to find the relation. please thank
if for one input symbol the transition is not given in the transition table and asks to identify whether this transition table is DFA or NFA then what will be the ans. ?
Thank you for this whole playlist on TOC & Automata!
What is this 250 written for ?
@@c2gr now that's a good step
Paying a ridiculous amount of money for a "reputable UK university" while I have to watching this life save videos on UA-cam in order to keep the struggle alive. This man deserves the tuition fee really! When would this be implemented? UA-cam Bsc certification?
Same story as well mate !
I was watching multiple videos and tried to learn from other channels, I felt like I was stupid, but after I came here at the first 2 minutes I realized the big picture and saw how easy is this, this means how much your channel is special, making things simple. Thanks.
Wow your english is pretty damn good, normally I have a hard time understanding the english pronunciations from the many different native countries that teach Computer Science but yours is pretty good and not boring or mono-tone at all which makes it very easy to listen to. The software you use to teach is also top notch, thank you my good sir!
may I know, which country are you from?
Sir your videos are like Magic..i dont know how should i thank you.
you can pay him using PayTm (link in the description box)
@@hrishabhsingh5647 😂
A day before exam at 2x speed
True af😂😂 just 2 days left for my exam😑😑 sir helps me alot
Dubb Chalise Dubb!
Literally me right now 2 days before my exam in discrete mathematics
3 days before exam at normal speed :D
3 hours before exam, every video in the playlist at 0.5x speed at the same time so you fully comprehend the material in the least amount of time. What do you do with the remaining time, you ask? Why, play more Overwatch, of course!
I had so much trouble differentiating between DFA and NFA. Thank you so much!
same lol
I love the way you explain this subject. Thanks for making these videos and educating the masses!
My lecturer spent 2 days trying to explain this concept to us and here is Neso Academy with a 6 minute video.
Very use full lectures .
I m Assistant professor in college n very helpful for me
15hrs before exam 🙌🙌 1.75x speed
same boat
Ruk likh leta hoon upsc ke exam mai na ajaye
3x here lol
@@yvsh youtube doesn't provide 3x playing speed , at least be realistic about what you are saying.
@@sagarnarendrasolanki4702 use revanced extended where you can put custom playback speed.
Indian UA-camrs are awesome. 😮
I watched several videos of toc from different channels... but i understand nothing..,.God showed me this channel and now I understand easily....i just wasted my time watching other channels.... thank you so much sir. Can you provide all videos according to the syllabus of UGC net
You are the best person in the entire world. I salute you sir.
even as a Chinese that is not a native English speaker, I can also understand it very clearly. best lesson ever, thx!
Don't dislike the videos this videos were better than all other videos
Nd I'm Tq for a excellent expalination of videos
Please you have any notes
The summary of the video is, that the difference between deterministic finite automaton and the non deterministic finite automaton. So in deterministic automaton, there is a unique next state which has no choice of randomness and is simple and easy to design. They are multiple next states which can be achieved using or consuming one input or no input in that case, in that case it is called that input epsilon. So that's a brief overview and differentiation between deterministic finite automaton and non deterministic finite automaton.
Can you make a video on Neir: Automata?
wtf
By the way the game was🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥
WWTF looool.
Perfectly explained, thank you.
Thank You
Thank a lot this playlist is amazing ! great work. thank you for the time you took for this!
sir your explanation is awesome please make videos on computer networks its not available any where
Thank you sir
Thanks a bunch 🤗
thank you so much
thank you i love you so much , your explain so good
thanks sir finally clear with good well explained example ,your method of explanation is appreciatable
Amazing explanation hats off to you
great lesson!!!
Thanks❤
Best professor
Csit 4th sem board exam of toc is day after tomorrow and here i am playing the playlist at 1.75x
Awesome video
Sir intro music is very old type ,but lectures are too good
asked my teacher the same thing about how to choose , which state we would go...she didn't even have a proper answer..
Thanks a lot !!!!! I appreciate your content
Ur voice is same as Profesor voice in Money heist series❤️😀
thanks Sir, For Your Valuable Guidance
lectures on push down automata and turing machines are not availabe
Now they are Available
Thank u for ur playlist❤ my final exam on automata will be on 2 days! feb 1 2024
Thank you for excellent educational material. I have one question regarding this video: Shouldn't the first statement be modified from "In DFA, given the current state we know what the next state will be." to ""In DFA, given the current state AND A GIVEN INPUT we know what the next state will be." ? Similarly I believe that the second statement should read as "Given a particular state and a given input, It has only one unique next state." Please confirm my understandig or correct me if I am wrong. Thanks in advance,
Sir you are a saviour 🙌💥😎👍👍keep it upp
Sir why u use only that type of diagram? I didn't understand that type diagram
thank u very much sir
Please you have any notes
2 hrs before exam at 2x speed
How can i use this information in my daily life?
Sir I stuck in one problem of nfa how to make nfa diagram of elevator?
You taught everything I need to know.... 4 hours before the test,LOL
Very well explained. Sir , thank you
thanks!
Very nice explanation, ty
thank you sir great video
got the difference completely
I got confused 😕 why it also transition on epsilon if it's not an epsilon - NFA.
Came here to check what's those P{Q} set would be... But it left me more confused.
Got it... All epsilon-NFA are NFA.
excellent video ....
Very helpful
Nice explanation of concept
what is the language represented by the DFA you showed?
Thanks alot
Nice
Thank you!
Tqsm sir...plz make a video on cd
Thanks
the video was very helpful...
Thank u
thank you they are similar but didnt understand whats the difference now i get it !!
please can you explain to me in video like these video the relation between Regular Grammar Regular Languages turing machine FSM NFA i am lost to find the relation. please thank
Beautifull explantion..
THANK YOU FOR HELPING
thnk u sir for this great lecture
Can you upload Graph Theory Tutorials and Numerical Analysis Tutorials?
are there no limitations in using NFA?
Thanks a lot!
Thankyou sir
before: i eM sTuPid after: I'm smart!
Hi, can a NFA (or DFA) have no start state? seems like there is no start state in the graph for NFA in the video :/ Thanks!
Thank uuu
Few hours before my CA 😅
Amazing
Welcome to drk students
NFA 3:17
thanks for your appreciable output
That is good I love that
if for one input symbol the transition is not given in the transition
table and asks to identify whether this transition table is DFA or NFA
then what will be the ans. ?
kazi poa bro
but self loop is allowed in DFA as well
how can you say unique next state still not clear
doesn't NFA has initial and final states?
Thank u so mch sr
Tqsm
Beat 10
Everyone in the comments is a college student and here i am just watching these for fun.
Watching few hours before exam😂
Very nice
As a dating show naii move on garnu
New contestants hru sngaa
2 hour before exam at 10x speed
Cleveland Ford
i like your videos
urehine qurban , urehine qurban...
Is DFA simpler or NFA I'm getting confused on geeksforgeeks its opposite
The Random Indian Guy is always there for the rescue