Thank you. You explained the topic really clearly. Just a minor thing you forgot is showing the accepting and the start states in the transition diagram.
thank you sir tomorrow i have exam i came to my friends flat to study numerical problems and some important question but my friends slept off today you have helped me a lot i have see type 1 and type 2 your videos sir thank you sir.
The two cases are different in the sense that the search position is different. The previous video searched it at the end of the string. So if a wrong combination appears, it still continues to look further. In this case, it searches in the beginning, so if not in the beginning then reject.
Hi! Loved your videos, they were extremely helpful. I was wondering how to tackle a problem with the following reg expression c(aUb)(aUb)*b. I'm trying to follow your process but I get stuck how to write the table. Thanks!
thank you for teaching us DFA but in this video you forgot to encircle the final state and put an arrow to the initial state.. some students like me might get a deduction for it... small detail but might as well include it :)
Harvey Bobila bro...its my mistake ur were r8.....i got my mistake €a is not there so € cut then a is there with q1.....and u have taken q1 soo its coorrect....thnxx...bro....u made my concept clear regarding the automato
Vishwakarma Raj I'm done with my automata class btw. thank you for creating videos like this bro it helped me pass the subject. keep up the good work you're helping a lot of students out here 🖒
Do not confuse it with the previous video, here you cannot eliminate.. just think of it a string that needs to start with aba and you get aa can you accept it ?
Your all videos are good.....but you please add the video for the following type..... L = {b^m a b^n whereas m,n >0 }......and sigma ={a,b}...Thankz in advance
Hello, thanks for the video, it really helps.. My question is you don't indicate the arrow for initial state and also double circle for final state or it doesn't have?
Could you please upload topics of NFA (non deterministic finite automata) , converting NFA to DFA ,minimisation of DFA,E-transitions , Mealy and moore machines in Formal Language Automata Theory (FLAT) subject ...
Thank you very much, very nice videos. Please someone clarify , at q2 when we got b we go to q-fi, then how it will be possible to have b on final state?
hey can you please tell how to work with two strings using above same technique ? like .. FA that accept exactly two strings, baa and ab ... please help because tomorrow is my exam !
can anyone just clear my one doubt.... i m getting confused in the question in :::: string ending with abb when we will have abba as a value in transition table as a whole it will not be there so we will seperately consider each alphabet or set????????
the guy who taught in the first tutorial was awesome...he was really good.
TQ bro super
8yrs later the video helping us out. Thanks for this masterpiece sir🙌🏾🙌🏾
Don't forget two circles around q3!
Great video thank you!!!
Right, since it is the final state.
I like the way you categorize the problems.
+Free Express That's me doing my job right :-)
Were you said when" a"combines with" q1", making it "aa" ..
This makes it start from a and it's not supposed to be assigned to the rejected state "q¤"
U are right it will start from q1
if you make it start from a, you would end up making a state machine that searches anywhere in the string...not the EXACT beginning
Thank you. You explained the topic really clearly. Just a minor thing you forgot is showing the accepting and the start states in the transition diagram.
Brother you are just awesome yarr,you just corrected my 3hr doubt in 7 min, love from maharashtra bro..... 🤞🤞
thank you sir tomorrow i have exam i came to my friends flat to study numerical problems and some important question but my friends slept off today you have helped me a lot i have see type 1 and type 2 your videos sir thank you sir.
man o man what a great way of teaching love this gb ....
Superb tutorial. I'd love to learn till the end of this entire tutorial series.
just a qq: why are you learning it at age 50?
Why didn't u use a reject in the type 1 ie. Strings ending with 100?
Yes same question .please clear our doubt
Are u clear now?? If yes please tell me y?
The two cases are different in the sense that the search position is different. The previous video searched it at the end of the string. So if a wrong combination appears, it still continues to look further. In this case, it searches in the beginning, so if not in the beginning then reject.
Why we take aba in this question since it only asking about the starting with ab
Then we should not take this state
it's Awsome to learn and pass my subject ...before that m blank regard to this subject. keep it up
very nice video..mera concept clear ho gya..so happy
Good Technique. Very good for starters.
Keep it up
However u have taught...it helped me a lot thankx yaar
Vere Level bro super explanation
MAN ,, I LOOOOOOOOOOVE YOU !!!!! YOU ARE AMAZING !! THANKS THANKS !!! I CAN NOT REPAY YOU BY MY LIFE EVEN
love you too reham
Super teaching 👌👌👌👌very interesting
Awesome..with correct logical reasoning.
Thanks a ton :)
Please do add more complicated examples..and videos on other topics as well,thanks :)
Ideal method to find the logic easily, thank you 😊
keep it up, you're doing a great job.
Ur awesome dude it's very easy and helpfull
Its really helpful thank you
you guys made it really easy for me to understand
It's really helpfull... I understand much.
Thank you! Really helped in clearing the concept!
Hi! Loved your videos, they were extremely helpful. I was wondering how to tackle a problem with the following reg expression c(aUb)(aUb)*b. I'm trying to follow your process but I get stuck how to write the table. Thanks!
FIrst Video guy AWESOME WORK
Thank u so much for adding this.. video it helped me a lot to understand how to construct DFA tq
hi pooja how are you dear? thank you
These videos are awesome!!!!!!!
+Huan Gu
Thank you :)
That was an amazing video. Thanks a lot, i really understood the topic.
thnx buddy
the way you touth is awsome
simply yr great
my mid exam in near on next week kindly upload other part of dfs
thanx again
+Yousaf Nadeem
Thank you :)
So Great! all series
At 5:30 in q2 state why you make it dead state there is a chance for making it q2??
thank you for teaching us DFA but in this video you forgot to encircle the final state and put an arrow to the initial state.. some students like me might get a deduction for it... small detail but might as well include it :)
Thanks, will do :)
Harvey Bobila bro...its my mistake ur were r8.....i got my mistake €a is not there so € cut then a is there with q1.....and u have taken q1 soo its coorrect....thnxx...bro....u made my concept clear regarding the automato
Vishwakarma Raj I'm done with my automata class btw. thank you for creating videos like this bro it helped me pass the subject. keep up the good work you're helping a lot of students out here 🖒
@@harveybobila4403 so which is the final state?? Please reply me!
@@yasminshaikh8583 q3
This is super helpful guys
Awesome video loved it thanks
Awsome somethings goes in my mind.. otherwise in my uni class I m blank...
i dont get this y u reject aa .. it cant be used as 'a' and in spite of Q fai ther must be q1
Do not confuse it with the previous video, here you cannot eliminate.. just think of it a string that needs to start with aba and you get aa can you accept it ?
For the last state shouldn't that be double circled to show that it is an accepting state?
can u give an example having more than 2 inputs ? it would be very helpful
If start and end state both are given, then how can solve
How the DFA would be for strings ending with b?
It's been 8 years since this video's but I hope you recovered from your cold quickly. ❤
Your all videos are good.....but you please add the video for the following type.....
L = {b^m a b^n whereas m,n >0 }......and sigma ={a,b}...Thankz in advance
amazingg.......😄😄
You are awesome..Please do more videos
Thanks a lot, it’s very helpful. Hope you can explain the NFA too.
Post complete course videos. Its a good methods u r following
Hello, thanks for the video, it really helps.. My question is you don't indicate the arrow for initial state and also double circle for final state or it doesn't have?
Excellent work
Is it compulsory to add reject in the table and daigram
Could you please upload topics of NFA (non deterministic finite automata) , converting NFA to DFA ,minimisation of DFA,E-transitions , Mealy and moore machines in Formal Language Automata Theory (FLAT) subject ...
How will I come to know that when I have to take the reject state?
Good stuff, congratulations and thank you very much
Anything for NFA
Thank You very much for your help
how do i know i need to do with reject state
when question is end with,why i dont need to have reject state
when the string is ∑b why we cannot move towards q0 instead of rejection state????
because the given string (aba) does not start with b
Plz also make a video on having with dfa
Awesome Videoo!!!!!
it's really helpful bro.....thank u soo much......
but can u explain the difference between nfa & dfa please
bro get a life?
Teach minimization of automata using table filling algorithm
hello bro..these videos are awesome..bt one doubt ..why (q1,a) will b q-fi???
It will be q-fi for Ex: take (q1,a)= q0 then string "aaba" will not be accepted
Please upload the videos of DFA of even 0's and odd's and similar type of examples
W can you decide it is type 2 problems ana how can you take reject state
It has helped me a lot...
What about not starting with something? Will making the non final states, final, do?
Thank you for saving my time! Great method, I'm wondering why didn't my instructor use it?
Thank you very much, very nice videos. Please someone clarify , at q2 when we got b we go to q-fi, then how it will be possible to have b on final state?
I want to know that whether DFA can have more than one final states or not?
+Ali Hamza Yes. DFA can have more than one final state.
but, in this case, what is final state?
Can u plz upload videos of how to construct nfa...your videos r really good
you are owsome man .. ! (y)
kindly upload for substring plz as soon as possible
sure buddy !!!!!
thanx
btw when..? :p
thanks a lot can u plz share more video on automata Theory as erly as possible my paper is aftr two days
Why didn't you remove the first element in the string when you didn't find a match as you did when matching strings in the first video?
Plz made a similar video on NFA ,if possible .
awesome duuuuuuuuuuuuuuude..!!! (Y)
Explanation is nice but I would suggest if you use any white board or anything and not waste these many papers that will be good :)
can you tell me when we use rejected state or when we not use
what happen if the input is 'a' only?
thanks buddy its help me
Could you please make a video on construction of NFA in easy method
can we construct this dfa without making a deadstate??
No I think ,then what about rejected states?
Upload video of designing nfa with this method similar like of dfa
Sir I don't judge you but I am confuse reject state allow in DFA?
is the accept state q3? Also, If asked: all strings not starting with aba, do we put all except q3?
How to solve those problems which have included both ending with or starting with????
hey can you please tell how to work with two strings using above same technique ?
like .. FA that accept exactly two strings, baa and ab ... please help because tomorrow is my exam !
your videos are really good. Can you do the following problem
design a dfa that has exactly two 1s and at least two 0s
Thank you :)
when we draw a rejection state?
when a string does not matches the state condition like q1->a and we got aa in our combination then we declare rejection state
can anyone just clear my one doubt.... i m getting confused in the question in :::: string ending with abb
when we will have abba as a value in transition table as a whole it will not be there so we will seperately consider each alphabet or set????????
Brother for making Transition table why you use two method of explaining it confused me. Tell me what to do
sir what about answer when he will ask that substring is aab what we have to do...
Is it compulsory to keep qpi
Is this the same with the first video
Plz add a video of Nfa to DFA conversion 😊
Great!! Thank you...
When there comes aa in q1 how you put there q.reject
can u plz Uplod more videos of Another topic..PDA Or Grammar..
Why we can use reject state
aa also starts with a or?
Yes but we need aba and not aa
Could you do video lesson about Turing Machine? ^^
awesome vidio
+unlimited entertaiment (shuvo)
Thank you :)