TOC | Minimization of DFA | Ravindrababu Ravula | Free GATE CS Classes
Вставка
- Опубліковано 19 вер 2024
- For Course Registration Visit: ravindrababura...
. For Any Queries, You can contact RBR on LinkedIn: / ravindrababu-ravula
Telegram: t.me/ravindrab...
Instagram: / ravindrababu_ravula_rbr
- GATE TOC Full Playlist: • Theory of Computation ... If you're considering studying abroad, don't forget to explore 'Games of Visas,' my dedicated consultancy service and UA-cam channel designed to streamline the process of studying abroad.
For Study Abroad, contact "Game of Visas" at 9494555454
sometimes examples are worth more than hundreds of pages of theory ...
i agree with you my friend
i know it is quite randomly asking but does anybody know of a good site to stream new movies online ?
@@bjornmartin6480 fmovies , soap2day
thanks :
content 10/10 ;
explanation 10/10;
Biceps 10/10 😂
why College don't teach this method....:( ? This is so much easier..:)..You're really a great teacher
Extremely clear explanation ! Good example! Steady pace. Brilliant video
Sir, please upload the lectures on pumping lemma..
This is a very clear explanation; the theoretical part shed light on the practical example such that I could understand not only how to do it but also why it works. Thanks.
superbb explanation !!! worth the concept !! i study whole tcs syllabus from your channel v v sensible.
Best teacher award goes to you Sir 🌟👌
This was so amazingly explained! Teachers should actually watch your videos and try to put in some efforts to explain like you do!
Merko bhi sikha de bhai colg me
@@harshalbhoir1262 Haha chal saale sab aatay tujhe
screw the table filling algorithm, this method is so much easier
Bautista is here ! Boom Boom Boom Boom
Just Wow!!!!!!!!!!!!! Is it possible to give an explanation better than this? I don't know. If possible, I will be then really amazed.
Can you explain why q0 and q2 are 3 equivalent with q1 not being a part of 2 equivalence?
Yes, q1 and q1 are in the same state (as you can see) and q2 and q2 as well, basically, there's no problem if both go to same state, as the state will always be contained in itself. It only causes problem, when it is going to 2 different states, and those states lie in different equivalence during previous stage
Sir your teaching style is definitely unique
superb explanation sir.your explanation is very peaceful to hearing
chha gaye guru...
Kash app hamare college me lecturer hote,
:'(
That's great sir. I wasted an hour in understanding this topic through book and that doesn't help me. But your video is great within one example topic is crystal clear to me. Thnx
This video saved my life!
In the last step, i.e 4th equivalent, it is shown q0 & q2 paired but for q0 & q2 with 'a' going to q1, which is not in same group in 3rd equivalent. So how is it possible??
I also wanted to ask this
How can we talk about "3 equivalent states" while there are only 2 inputs?
Also, q2 and q3 both go to q1 with input a. Shoudln't they be 1-equivalent?
Thanks for sharing the easier way to solve it. Professors at uni never tell us this
thank u so much sir for giving clear concept in all topics...
Sir by listening your lecture we understand the concept more thoroughly .thanks a lot.
why we cant directly draw the minimized DFA by seeing the same states from the table.
same Q bhai
Of course bro observe it
q4 is the final state so it's going to be separated
q0 & q2 are have same states
q3 is separated due to final state which is q4
Finally q1 is separated due to q3
That's it 🤠 it's very easy and simple bro
U need to separate final States first and then separate every state by seeing it's states directly no need to write equivalents
The best sir ever !!
bro you are awesome.....i owe you .
Thank you sir.. Nice explanation!!!
+Mayank Neema add me to face book i need to took you i have a problem in an exercise minimization
facebook.com/alae.kharkouk.9
Thanks a lot brother! You explained it really well.
Thank you a lot... You made to understand too easy.... Again a thank.....
Equal states go to same behaviour state or states
q0,q1,q2 have same behaviour
Y You separate q1
It's not the correct place or time, but must say the dude is handsome
we got 2 equiv: as [q0,q2],[q1],[q3],[q4] at time 14.04... but in 3 equivallent we check for (q0,q2).. (q0,a)= q1 (q0,b )=q2 (q2,a)=q1 and (q2,b)=q2... then we can check in 2 equiv: table.. q1 is saparated... then how we can said that they are equivallent.. pls help me
+Faizal Basheer - Good point , I was wondering the same thing.
+Faizal Basheer - I think I get the logic. Think about this- if q0 goes to state q1 on symbol "a" , and q2 also goes to q1 on"a"... similar for symbol "b" .... then they are equivalent.
This is in accordance to his explanation from before ....the problem you said , will only arise if while comparing two states , we go to two "different" states on a symbol. In this case , BOTH q0 and q2 are going to either q1 ( on "a" ) or q3 ( on "b").
+malhar jajoo haii... I got the logic later when I experienced with another examples..
+malhar jajoo thank you my friend for this great explanation
+Faizal Basheer - you are welcome my friend.
Thanks a lot, it's a very clear explanation!
More than what I learnt in my lectures! :) Thank you sir!
Thank u so much
Great teaching 😘
Awsome explanation ...thx..
Fantastic explanation!!!
turing machine videos sir plzz upload
what to do if pair of a is in one state (for eg in non final ) and pair of b is in another state(for eg final)
very well explained sir ! now i have got the clear concept of minimizing a DFA.. thankyou so much ! (y)
Very easy to follow and helpful.
what to do if my q3 does not have a 'b' transaction so it's blank in the transaction table? how can I compare it with the others?
Thanks sir. .... It was helpful
thankew So much sir :)
sir, you are awesome :)
but for cheching 3 quiv. for q0 and q2 , they are going to q1 on a but q1 is already separated, then how can we make them one?
Please tell nfat to dfa conversion in which set of all strings over input symbol a, b in which second symbol from lhs is a
Thanks. If there is a dead state in this F.A. then do we have separate it in the next equivalence?
ty sir !!/you've always helped me !!
Great work thank you
Well Explained ,sir . Thanks a lot.
best teacher
your video has save me ... thank you so much
Very good explanation. Thanks
sir,how q0 and q2 are same quivlent???you said that we have to check in the previous equivalence list so in previous equivalent list,q1q2 are not in same group. Plz reply soon..i hv my exam tmrw...
Very much useful. Thanks sir!
Nice explanation.
good ... understood clearly
love this method exam in 20 minutes.....
Thanks sir now I understood very well
why cannot we combine the final state.... as the final state as same transition as q0 and q2 on input a and b?
Thank you so much sir
2:43 Boi stop flexing
Can't we see from table rather than comparing equivalence? Please ans
Super 100 /100 excellent sir
Is partition method belongs to myhill nerode theorem?
Great explanation.....
Sir, can you please tell me the regular expressions of that dfa?
if i dont remove tht state which is not reachable from initial State thn wht happens....?
n can i solve my ques in exam without removing tht state....?
Thnk u dea dat ws really helpful
how are q0 and q1 equivalent if they go to the same state on a but to a different state on b? 8:45
+Alex P. because both q1 and q0 belong to the same upper equivalent group that is they both belong to 0 equivalent group.
you did not read the definition right.it is because they are both going to a non final state.
condition was either they must go to a final state or non final state
It was helpful
Keep it up 👍👍👍👍
Man, why do you group q0, q1, and q2 in the same grouping?
but q3 is not an accepting state and he grouped it together with q4.
video hidden kyu kr dia exams hai sir
thnq soo much #BROTHA
Sir , at 14:28 qo and q2 are going to q1 and q2 (on a and b ) respectively , whereas q1 is in different group. Hence we cannot put qo and q2 in same group . Kindly explain, if I am wrong .
at 14:28 qo and q2 are going to q1 and q2 (on a and b ) respectively but q1 and q0 are in the same group in 1 equivalent so u should not separate it. because when u r writing a new equivalent u need to check with the previous equivalent, if they belongs to same group in the previous equivalent u should not separate otherwise u can separate.
naveen kumar But for 3 equivalent state we only need to check previous 2 equivalent state, right?
refer to 2:04 when sir said if (p,q) on seeing any i/p goes to same non final state then they are equivalent.So in this problem (q0,q2) goes to same state (q1,q2) on seeing i/p a,b so they are equivalent.
but they are going to q1 which is not in the first brackets
Thank you sir!! can you please suggest me the best book for referring TOC ?
+sanket kurude
K L P Mishra ( theory of computer science )
Really helpful!
Thank u sir it's really helpful
In last step seeing 2 equivalent we can say that q1 is in another set
How q0 q1 are taken in same group pls help
(I'm talking about 3 eqivalent)
As u can see that q0 and q2 upon scanning with a and b reaches to same state as q1 and q2 respectively so they will always be equivalent, don't consider previous equivalent (in this eg. equivalent 2) in such cases
Why not we directly combine two equal transitions? like like rows 1 and 3.
Thank you so much
sir, agar given table me final state na ho to us ko kis tarah minimize krte hai
A DFA without a final state is known as a transducer. Mealy and Moore's machines are the example of FSM transducers. Since they produce an output corresponding to each state, it doesn't make sense to reduce their states.
awsm explanation..
Sir pwoliyaan
Sirra sir sirra explanation
why we need to group q0,q1,q2 in one group and q3,q4 in another group how did we differ that??
watch the whole video
very helpful.. fully technical... hitted subscribe.....!! one request from my side if possible share some short tricks for verification!!
good teach, buddy / thank you.
How did u decide that q0 and q2 after combinig are start state???
Because q0 is the initial state in the question.
Just like q4 is the final state in both the diagrams, q0 is the initial state.
Sir, Which method(Method name) are u used in this minimization.
Partition method
Thanks.
Thank You Sir..
Thank you sir!!! :)
thanks a lot sir..
nice explication thnks
Myhill nerode theorem?
if question is asking to minimize using Myhill Nerode theorem then we can solve it by using this method
the best!
Morning, i need to construct a AFN with this
∑ = {0,1}
ER = {0,1}* {1010}
awesome