Ma'am Pura dinner plans sikha fir chod diya dusare diin apaka video recommend me Aya oor basss 15 min ke anddar hi Pura PDA concept samaj gya thank you very much Ma'am
Mam naku oka doubt undi mam Nfa lo backtracking untunda undada ani mam Konni sites lo emo backtracking is always not possible ani undi mam Konni sites lo emo backtracking is may or may not required ani undi Indulo edi correct anedi artam kakundi mam
Ma'am Pura dinner plans sikha fir chod diya dusare diin apaka video recommend me Aya oor basss 15 min ke anddar hi Pura PDA concept samaj gya thank you very much Ma'am
nailed it , watching 38 min before exam....
Super ma'am you make this topic more easy
Instead of saying "'A'" say '"Yeeeeee"' 😂😂
By the way good lecture
Thank You Mam......
Thank you maam for making this topics more easy as compared to other🥰🥰
wonderful...thank you so much!🌻
Why b was not popped? How to know when which symbol should be popped and which should be in no change form ?
here b is skipped
@@kstubhie Why? Isn't useless then?
super teaching mam ...so helpful
🤩
How did you pop why did you change to q1 explain in details
Super madam very good explanation 😊😊
thank you madam well explianed
Thank You ma'am! May God bless You!
n>=1 and also m>=1 then we take aabbcc but in this you take aabbbcc how?
M=3 N=2
Here a and c are equal
Its our wish dude they had mentioned >=1,so it can be anything according to the string we take!!
aabbcc and aabbbcc both are acceptable here . 🙂
n is 2 ,m is 3
In this , PDA machine should accept any string of any number of b's so n may be same as m or different
Loads of thanks...mam..😁😁
Why we not pushed b in stack by popping a
Because a and b are not equal
Explained in a very simplified manner, hats off to you mam
@@ianalpha1917 bruh
@@ianalpha1917bruh
Great lecture 🙏...
Nice explanation we want more example on pda please mam ❤️❤️
Construct a Turing Machine to accept the language
L = { WcWR | W ∈ (a + b), n>=0}
solution of this question
Mam why we didn't count b value in the third transition when we went from q0 to q1?
Very helpful, thankyou mam
you are amazing....thank you
Can we stay at the same state q1 and pop without going to q2 please reply
do you know why now? I have same question
@@fengyuanma587 do you know why now? I have same question
Excellent work mam
can you explain for 0^m1^n(01)^m ? Thanks
Why b is not popped
What if q1 just passes a and runs b instead
Good explanation ❤️
what if it be a^n b^m c^(n+1), how'd we solve it?
Ma sir ne video chusey college lo cheypadu same to same line by line😂
Mam is the last epsilon transition to q3 state necessary??
Mam why you defining rules blindly for pop operation, it's ambiguous and can you explain the logic or theory!!!!?
hatsoff to u maam,thank u so much
Mam y u did not wrote 3 B's in problem u wrote only 2
Recursively called
How to do for same power for all symbols??
you changed state for b,a/a from q0 to q1. Is it necessary to change the state or I can just loop it on the state q0?
yes u can loop q0
Where is example?
yay or ae ??
Mam naku oka doubt undi mam
Nfa lo backtracking untunda undada ani mam
Konni sites lo emo backtracking is always not possible ani undi mam
Konni sites lo emo backtracking is may or may not required ani undi
Indulo edi correct anedi artam kakundi mam
ağzına kürekle vurasım geliyo izlerken
thank you from türkiye
a^n b^n C^n how b get 3 when n>=1 its wrong
It's totally on you. They mentioned that n should be 1 or greater than 1 means any number like 234567.....
Thank you so much mam!!
b ki power m = pavaliion
explaination is very good but stop doing zooming out and in
Eminem is afraid of her...
ye
Love you😘
Thanks
Thank u mam
U left the 3rd b
No need. It gets repeated recursively.
❤
This is Aktu pyq
Apko mam video edit karne ka akal nahi blur mat karo bich bich me irritate hota commonsense use Karo mam
ये
Wrong
Thank you mam
thank you mam