Was contemplating on creating a Compiler for my little language, this series of tutorials helped me a lot. So simplified are the explanations, more understandable than text explanations. Please keep up the good work.
Excelent! Thanks a lot from Brazil. I had difficulties when I studied this subject at college but after watching your classes I am a little more confident.
I wish I had found you 4 years ago. My life would be a lot better now. If it should still turn around because of your videos, if I should continue with my Masters, I will give a big thanks
My faculty took 2 weeks to explain that with lots of examples and all that stuff I was bored asf and didn't understand anything its his teaching style not suit me but this 10 mins video❤ learning is fun
Out of all the other video lecturers from channel such as tutorials point , education 4u,Khan academy, etc.. neso academy is the best study channel that I have ever seen thanx a lot ..mannn..great work keep going..
I had FAFL when I studied my engineering. For some reason, I couldnt master the subject to the extent what i intended. 15 years gone by and I decided to refresh the basic of computer science starting with FAFL and Discrete Math. Loving watching this series as it is bringing back a lot of memories along with better understanding of basic CS. Are there any notes that I can download [as in just the images that you have drawn] in a PDF format perhaps ?
I dont mean to be so off topic but does any of you know a trick to log back into an Instagram account?? I stupidly forgot my login password. I love any tips you can offer me.
There is a small leap between the concept of Language and the FDA. In fact, we already know that the FDA could be used to generate Langauge and the Language also could be used to generate DFA, they are same concept with different definitions. But in this section 4, you've not explained their connection yet, and assume that we know it. This is a little difficult for audience. It's just a small suggestion to insert the explaining section between the Section 4 and Section 3 on the connection of FDA and Language. You did a great job on this computation theory knowledge sharing on this planet, Thanks!
Sir why can't we place the self loop in A state for input 1 instead of considering another state C. If input would be 1 then it would remain in A or if 0 then it will go to final state.
Because it will accept inputs that start with 1. Picture this, for example, the input is 100: Input 1: Stays in state A Input 0: Goes to state B Input 0: Stays in state B The string is then accepted even if it did not start with 0. But using a separate state C: Input 1: Goes to state C Input 0: Stays in state C Input 0: Stays in state C The string is then not accepted as it was deadlocked in state C.
Because C is a dangling or dead state which means all the input that shouldn't be included can be pointed to this state... And to answer your question if you put a self loop on A it will accept strings like 101 or 1010... But we can only accept strings that start with 0 hence we created a dead state instead of putting self loop on A
great explaination... just had something in mind...what if we put a self loop on state A for input 1..i guess then also it will be ok... we won't need to go to the dead state.
@@leroypalmer9226 no bro. the requirement is accepting the string that starts with 0.. if any 1 comes in the beginning it shouldn't reach final state at any cost . that's why we sent it to dead state.
Is it necessary to add the C state in case the first digit is 1? I mean isn't it enough just to have the state B in case the first digit is 0? What happens if we don't add support for invalid cases?
The reason why we even add an invalid case is to define our language well. Take it like this : We are creating a language such that the language only has 0 as the starting string. Therefore the automaton proceeds from initial state to state 2 only if the first input is 0. So what if I give an input 1 ? This is why I'm creating a trap state in my state transition diagram.
Thank you man, that is very nice. But i have a question: Why to send the input 1 to the state C (Why to make the state C part) if we already know that our language does not contains any string which starts with 1?
Because in DFA every state should have path for each input since in this example the input are 0,1 so in state A there should path for 0,1 therefore there is two path for state A.
After 9 years since I started CSE course, today I understood the basics of TOC
How is your career going?
Its my last semester and birthday tomorrow, I will be celebrating it with Neso. Thank you Neso Academy!!
same here but birthday shifted to next semester
@@SAbbasy 😂
Was contemplating on creating a Compiler for my little language, this series of tutorials helped me a lot. So simplified are the explanations, more understandable than text explanations. Please keep up the good work.
Dhd
What is the name?
Hope youtube gives you a lot of money. Pure Legend
man UA-cam is such an unfortunate media, i can only give one thumbs Up, amazing tutorial, thank you!!
I will give him one more on your behalf!
Donation link in description :)
You can donate money if you want to, link is in the description
Well, If you want you can donate at www.nesoacademy.org/donate
3 years ago...
Just started my Theory of computing class on Tuesday and I'm glad you made these! thank you!💙
Excelent!
Thanks a lot from Brazil.
I had difficulties when I studied this subject at college but after watching your classes I am a little more confident.
I wish I had found you 4 years ago. My life would be a lot better now. If it should still turn around because of your videos, if I should continue with my Masters, I will give a big thanks
sir I cnt explain how much have you done by these videos...you are amazing..keep doing good work sir
Honestly this is the first video I've watched from your channel, but you saved my day. I love you so much
The way he explains is the best
Idu the final state!!
I almost give up to my course, because of the subject automata. I thought it's very complex, the way you explained it is very easy to understand.
reallll, this is me currently☺
This guy explained much more information than my professor. lol.
thanks for this, you've gained another subscriber
My faculty took 2 weeks to explain that with lots of examples and all that stuff I was bored asf and didn't understand anything its his teaching style not suit me but this 10 mins video❤ learning is fun
Same here
Trying to build a DFA was kicking my butt, but after seeing your video I know what I need to do. Thank you so much!
neso academy always saves the day!
Always some unique, logical and dedication type method.
all academic areas must understand this.
Out of all the other video lecturers from channel such as tutorials point , education 4u,Khan academy, etc.. neso academy is the best study channel that I have ever seen thanx a lot ..mannn..great work keep going..
Valeu!
What an explanation ✌️
Literally hats off to you. .may god bless you man!
yeah
Thank you so much! Greetings from Argentina!
I had FAFL when I studied my engineering. For some reason, I couldnt master the subject to the extent what i intended. 15 years gone by and I decided to refresh the basic of computer science starting with FAFL and Discrete Math.
Loving watching this series as it is bringing back a lot of memories along with better understanding of basic CS.
Are there any notes that I can download [as in just the images that you have drawn] in a PDF format perhaps ?
I owe my flat grades to you! Thank you for explaining so wonderfully
I dont mean to be so off topic but does any of you know a trick to log back into an Instagram account??
I stupidly forgot my login password. I love any tips you can offer me.
@Darwin Adriel instablaster :)
@@elishavincenzo1833 This is a bot and a scam.
@@lucy-h Elisha is also a bot
@@pranav288 Yep, pretty sad really
The way you fluent English is really fabulous...
yeah....
@@sahithi_sribhashyam your teaching skills are good, keep going
Your grammar is horrible though....
@@gigachadkartik what do you mean bro ?
What goes to state C, stays in state C.
You can check out anytime you like but you can never leave.
@@ritiksrivastava3093 Welcome to the hotel "C"alifornia
My callertune tho....
1
Any string starts with '1'
Thank you so much, man, you're really helping me out!
Amazing explanation
Our teacher sucked at explaining these , finally I found something. Thanks
Explained in 10 minutes what my professor couldn't in an hour and a half
Everyone Lecture You Explained Well.......Thanks a Lot Sir
Thanks 👍 , from republic of Yemen 🇾🇪🇾🇪🇾🇪
Good explanation sir
There is a small leap between the concept of Language and the FDA.
In fact, we already know that the FDA could be used to generate Langauge and the Language also could be used to generate DFA, they are same concept with different definitions. But in this section 4, you've not explained their connection yet, and assume that we know it. This is a little difficult for audience. It's just a small suggestion to insert the explaining section between the Section 4 and Section 3 on the connection of FDA and Language.
You did a great job on this computation theory knowledge sharing on this planet, Thanks!
Great explanation thank u today i have presentation on finite automata and ity types this is helpful
Hi, it's me, the new generation. learning automata theory as well!
Very good explanation ...such an ideal tutorial ...
Great explanation..
thank you bro actually prepared me for my test the day before
Sir you are grate .....yore hope of many many students
Wonderful refresher, many thanks
Superb the examples are amazing
Thanks for making the video
Sir you are providing us the great help.....Thank you so much.....May god bless u
Keep teaching & sharing......
Nice explanation with verifying that constructed DFA 👌
Everything was Perfect except that you missed to define the alphabet i.e {0,1} I would give you 9.9/10 It was simply amazing. 😁😁
❤Well explained.. Thank you very much..😊🔥🔥🔥👍
hats off 👏👏you peoples are rally rocking 😍thanks a lot😇
Excellent work
I freaken love you and this channel for this content!
Excellent teaching process
You’re a literal god thank you so much
Amazing tutorial sir. thank you!!
I love the outro music
Thank you bro,I understand well ,superb teaching
Thank you so much for this!
Sir why can't we place the self loop in A state for input 1 instead of considering another state C. If input would be 1 then it would remain in A or if 0 then it will go to final state.
i really want to know why
same Question
Because it will accept inputs that start with 1. Picture this, for example, the input is 100:
Input 1: Stays in state A
Input 0: Goes to state B
Input 0: Stays in state B
The string is then accepted even if it did not start with 0.
But using a separate state C:
Input 1: Goes to state C
Input 0: Stays in state C
Input 0: Stays in state C
The string is then not accepted as it was deadlocked in state C.
Because C is a dangling or dead state which means all the input that shouldn't be included can be pointed to this state... And to answer your question if you put a self loop on A it will accept strings like 101 or 1010... But we can only accept strings that start with 0 hence we created a dead state instead of putting self loop on A
Perfect explaination tq neso
Very well explained. Thank you!
Thank you so much, this helped me so much!!
Wow...Thanks! You make it simple and easy to understand.
Hat's off to you sir!
1:59.....why you gives double circle on B
How you decided this is final state....
Please give me answer sir...🙏🏻
thanks broo, you saved my day
Most most most helpful,thnks is not sufficient for this..still god bless you sir 🙏🙏🙏🙏🙏
wow, you made it look so easy
Thank you thank you thank you thank you x1000! Helped me understand it so much better.
You help us to move on bright path thanks you so much❤
waaaayy better than my university professor.
Well explained
Thank you so much ❤️
amazing videos, thank you very much sir
Amazing! thank you
Thank you.I am happy 😊
Hii Sindhu ❤
great explaination... just had something in mind...what if we put a self loop on state A for input 1..i guess then also it will be ok... we won't need to go to the dead state.
this is also my belief. I think we should stay in the same state as that is what my professor also does.
@@leroypalmer9226 no bro. the requirement is accepting the string that starts with 0.. if any 1 comes in the beginning it shouldn't reach final state at any cost . that's why we sent it to dead state.
Why are we wasting money in our boring colg lectures instead of listening here!💐
It helped a lot thank you sir
Thanx
Very nice lecture
Excellent video
Amazing keep it up 😍😍👍👍
Is it necessary to add the C state in case the first digit is 1? I mean isn't it enough just to have the state B in case the first digit is 0? What happens if we don't add support for invalid cases?
The reason why we even add an invalid case is to define our language well.
Take it like this :
We are creating a language such that the language only has 0 as the starting string. Therefore the automaton proceeds from initial state to state 2 only if the first input is 0. So what if I give an input 1 ?
This is why I'm creating a trap state in my state transition diagram.
How about ends with 001 for example: 1001, 101001, and 001 are accepter while the strings 1000, 10011, and 0010 are rejected.
we dont care about any 1 except at first position
awesome video. keep up the good work.
its easy to understand sir thank u sir
Thank you man, that is very nice. But i have a question: Why to send the input 1 to the state C (Why to make the state C part) if we already know that our language does not contains any string which starts with 1?
i think to tell computer how to handel it when there is wrong input because computer didn't know how to handel it him self
Because in DFA every state should have path for each input since in this example the input are 0,1 so in state A there should path for 0,1 therefore there is two path for state A.
Sir, but we shouldn't specify dead state in DFA. In NFA, we can.
it really helped me a lot thank u sir
Thank you sir.. It's really Smoth n easy to understand..
very; nice explanation
why we took C when we can stop at B (as B is having self loop 0,1 )
and A is also starting from 0 so there wasnt any problm
very precious lecture series.
best .....nothing to say easy explanation
Thank You
Why didn't we made c as a final state? Because input 101 wasn't included in the string we were given right?
becz we dont want string starting with 0 so we made c as trap state and havent made final state
thank you so much .
is't using 2 states enough ? a is non accepting and b is accepting .
You forgot to define the set of inputs. In the case of your example the set of input should be {0, 1}
LOVE IT! THANK YOU!
I will give it 10/10 thank you so much for that explaination
bro it's 7 y/o video but it still slays 💀
Thanks
*Excellent*