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
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.
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.
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.
Sir i don't understand what happened at state B State C be itself for initial state is 1 State B be itself The initial state 0..why??why we take state B is end state Sir please explanation of it
a question.. in the previous videos you have said that in DFA we have only one unique next state and in NFA it has multiple next states. but in the video above it is an example of DFA so how come state A can go to both states B and C?
Im four months late, but basically, NFA is when a state, can go to multiple states WITH the SAME INPUT. lets say, Input 1, takes B to C and also B to D. it
Sir i am unable to draw the transition diagram for most of the questions, so can you tell me how should I think to draw it? Steps to be followed? Explain in an easy manner Thanks
I have trouble with concepts of final, dead, and trap. The FSM arrives at final state, but continues to read symbols, what is final about that? How is a dead state different from a final state? In the previous video, the FSM could transition out of a final state. Even if final and dead were renames to success and fail, the machine would still be processing new symbols.
Why the second example of 101 has been discussed in the lecture when it was not an element of L1? Sometimes giving unnecessary examples create more confusion.
at 3.12 (timespan) you did put on a self-loop on B, but loop is not allowed in DFA as you said before and previous lecture. then why you added a loop now?
After 9 years since I started CSE course, today I understood the basics of TOC
man RUclips 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...
Hope youtube gives you a lot of money. Pure Legend
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?
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.
This guy explained much more information than my professor. lol.
thanks for this, you've gained another subscriber
Honestly this is the first video I've watched from your channel, but you saved my day. I love you so much
sir I cnt explain how much have you done by these videos...you are amazing..keep doing good work sir
The way he explains is the best
Idu the final state!!
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
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☺
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
neso academy always saves the day!
Valeu!
Thank you so much! Greetings from Argentina!
Always some unique, logical and dedication type method.
all academic areas must understand this.
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!
What an explanation ✌️
Literally hats off to you. .may god bless you man!
yeah
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 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
Amazing explanation
Our teacher sucked at explaining these , finally I found something. Thanks
Thank you so much, man, you're really helping me out!
Everyone Lecture You Explained Well.......Thanks a Lot Sir
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'
Explained in 10 minutes what my professor couldn't in an hour and a half
Great explanation thank u today i have presentation on finite automata and ity types this is helpful
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!
Thanks 👍 , from republic of Yemen 🇾🇪🇾🇪🇾🇪
Great explanation..
Hi, it's me, the new generation. learning automata theory as well!
Very good explanation ...such an ideal tutorial ...
Superb the examples are amazing
Thanks for making the video
thank you bro actually prepared me for my test the day before
❤Well explained.. Thank you very much..😊🔥🔥🔥👍
Wonderful refresher, many thanks
1:59.....why you gives double circle on B
How you decided this is final state....
Please give me answer sir...🙏🏻
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
Sir you are grate .....yore hope of many many students
Nice explanation with verifying that constructed DFA 👌
Sir you are providing us the great help.....Thank you so much.....May god bless u
Keep teaching & sharing......
hats off 👏👏you peoples are rally rocking 😍thanks a lot😇
Thank you bro,I understand well ,superb teaching
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.
You’re a literal god thank you so much
Excellent work
Most most most helpful,thnks is not sufficient for this..still god bless you sir 🙏🙏🙏🙏🙏
Amazing tutorial sir. thank you!!
Very well explained. Thank you!
Wow...Thanks! You make it simple and easy to understand.
Excellent teaching process
I love the outro music
Thank you thank you thank you thank you x1000! Helped me understand it so much better.
Thank you so much, this helped me so much!!
Perfect explaination tq neso
thanks broo, you saved my day
Hat's off to you sir!
I freaken love you and this channel for this content!
Amazing! thank you
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 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
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
Well explained
Thank you so much ❤️
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.
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
wow, you made it look so easy
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. 😁😁
It helped a lot thank you sir
is't using 2 states enough ? a is non accepting and b is accepting .
You help us to move on bright path thanks you so much❤
Sir i don't understand what happened at state B
State C be itself for initial state is 1
State B be itself The initial state 0..why??why we take state B is end state Sir please explanation of it
Thank you sir.. It's really Smoth n easy to understand..
Thanx
Very nice lecture
Doubt : Is it necessary to define the state 'c'. why can't we left it , it doesn't cause any error
Please suggest something
I think it's there to take into account every input, regardless whether it's 'necessary' or not.
You need to fill the "happy path" and error cases, state 'c' is for the latter
amazing videos, thank you very much sir
why we are only taking input as 0 and 1
a question.. in the previous videos you have said that in DFA we have only one unique next state and in NFA it has multiple next states. but in the video above it is an example of DFA so how come state A can go to both states B and C?
Im four months late, but basically, NFA is when a state, can go to multiple states WITH the SAME INPUT. lets say, Input 1, takes B to C and also B to D. it
why we should take only 0 and 1 as inputs?
Because E={0,1} will be given question
waaaayy better than my university professor.
very; nice explanation
Amazing keep it up 😍😍👍👍
What about 010?is it getting accepted here?
Yes
Excellent video
Is it ok to put a self loop on A when the input is 1 ?
Sir i am unable to draw the transition diagram for most of the questions, so can you tell me how should I think to draw it? Steps to be followed? Explain in an easy manner
Thanks
Same prblms
What about other strings? This language is not limited to 1 and 0, right?
I have trouble with concepts of final, dead, and trap.
The FSM arrives at final state, but continues to read symbols,
what is final about that?
How is a dead state different from a final state?
In the previous video, the FSM could transition out of a final state.
Even if final and dead were renames to success and fail,
the machine would still be processing new symbols.
Abhi kya he btaao ab toh ho gyi engineering aapki 😂😂
Thank you.I am happy 😊
Hii Sindhu ❤
its easy to understand sir thank u sir
Thank you so much for this!
Why the second example of 101 has been discussed in the lecture when it was not an element of L1? Sometimes giving unnecessary examples create more confusion.
Sir we replace a b c on that place q0, q1, q2????
is it a must for a string to have a dead state?...... or can you leave it out?
at 3.12 (timespan) you did put on a self-loop on B, but loop is not allowed in DFA as you said before and previous lecture.
then why you added a loop now?