sir, in this language, even if we cant find the center, we can use another logic ryt? that is, example:the string is abbaabba, then no of a's in first half is equal to number of a's in second half, also same for b's. so we can give transitions such that, if input symbol different from stack-top symbol, push. and if input symbol same, then pop, then itself the whole string will be accepted ryt??
Sir, your explanation is very much understandable when compared with our faculty. Faculty we've wanna explain in English tho they're unable to communicate with us in english properly. Though they know telugu they don't teach us in Telugu. This is quite annoying. But your videos are like Oasis for us sir. I even subscribed to your channel and suggested it to my friends too! Your efforts are much appreciated 👏 thank you very much sir! We'll keep supporting you! Sir, kindly please provide transition functions too sir 🙏 Also, how to solve this question sir? Language={a^ib^j | i not equal to j and i not equal to 2j}
Sir, in some question, going to final state removes Z0 . But some question, going to final state doesn't remove Z0. Like in this question , Z0 is not popped at last.How can we identify the questions in which we have to pop the Z0 too?
There is no problem if the stack contains z0 or not. In both cases the stack is empty. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
sir i have my atc exam tomorrow .what i couldn't learn in a whole sem u hv taught it in a span of few minutes.thank u so much.🙏🤝
All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Just Subscribed to your channel, my friends all watching your videos on TOC now 😀😀. Keep up the good work Sir.
Awesome, thank you.
you are the best teacher ❤❤ legend❤❤thank you for teaching us
Wow, thank you. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Thank you sir❤ all ur toc playlist downloaded. Thank you🥰
Most welcome 😊. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
sir, in this language, even if we cant find the center, we can use another logic ryt? that is, example:the string is abbaabba, then no of a's in first half is equal to number of a's in second half, also same for b's. so we can give transitions such that, if input symbol different from stack-top symbol, push. and if input symbol same, then pop, then itself the whole string will be accepted ryt??
Okay. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Thank you so much sir, because of you I've done well🙌🏻🤝🏻
Congratulations. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Your explanation is very well sir .....🎉
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
sir you are really awesome teached it so well thankyou 👌👌
So nice of you. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
perfectly explained
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Sir is it same for (a, b) * and (a+b) *
yes. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir, your explanation is very much understandable when compared with our faculty. Faculty we've wanna explain in English tho they're unable to communicate with us in english properly. Though they know telugu they don't teach us in Telugu. This is quite annoying. But your videos are like Oasis for us sir. I even subscribed to your channel and suggested it to my friends too! Your efforts are much appreciated 👏 thank you very much sir! We'll keep supporting you! Sir, kindly please provide transition functions too sir 🙏
Also, how to solve this question sir?
Language={a^ib^j | i not equal to j and i not equal to 2j}
pda example? very soon . Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@@SudhakarAtchala yes sir!
it was really nice
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Thank you sir ❤
Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Can we make q1 the final state and remove epsilon part
No. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Wow 😲
Thanks
Superb
Thanks 🤗. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir, can you make videos on solving NPDA also?
If you mention examples, like wwr, I will try. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir, in some question, going to final state removes Z0 . But some question, going to final state doesn't remove Z0. Like in this question , Z0 is not popped at last.How can we identify the questions in which we have to pop the Z0 too?
There is no problem if the stack contains z0 or not. In both cases the stack is empty. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
automata also done sir thanks
Welcome 👍. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Thank you sir
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
👏
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
thankyou sir
Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
In last step why didnt you popped the stack top i.e Zo?
Not needed. if you want you can , not much difference . Plz subscribe to the channel and if possible share with your friends. Thanks in advance..