Ma'am I have one doubt if number of input alphabet=n then the number of states become n+1 . But in this we have 2 input alphabet and states are 4 how it possible
Adding a new element on the stack changes its state but here when 2nd b was entered amd a pop is performed why state changes when its still in b element
A big thank you mam ...I am veryy much confuse about working of Turing machine ...how it work on stack and all...you solve each and every problem....you are great teacher ...🙏🏻🙏🏻
Better than the professional UA-camr so-called teacher......Tq.
day before semester be like studying whole syllabus .........................................
Mam you're extremely super for explaining the tough content in the simplest way.Thank you soo much for the playlist of theory of computation.
really helpful for people like me, who just study one day before the exam
very best explanation mam on whole youtube!
I am passing most of my lessons with your help
Just wow....perfect explanation....thank you so much
This was the BEST explanation.
Ma'am I have one doubt if number of input alphabet=n then the number of states become n+1 . But in this we have 2 input alphabet and states are 4 how it possible
Here q1 state is optional because there we are not doing any push or pop operation.
Adding a new element on the stack changes its state but here when 2nd b was entered amd a pop is performed why state changes when its still in b element
Yes
For pop operation also we should change the state
Mam if we take 1 input a and push 2 a's in stack ...so when we input b we pop a's ...does this work ???
Nice Mam 😊
Mam how do we know when to perform push and when to perform pop
A big thank you mam ...I am veryy much confuse about working of Turing machine ...how it work on stack and all...you solve each and every problem....you are great teacher ...🙏🏻🙏🏻
视频内容非常有趣!有些事我不明白:我的okx钱包里面有usdt,我有恢复短语。「pride」-「pole」-「obtain」-「together」-「second」-「when」-「future」-「mask」-「review」-「nature」-「potato」-「bulb」: 我应该如何把它们变成比特币?
Mam How do we know when to change the state??please reply
When we enter new input
When the input is changing from a to b
When you change input from a to b, or perform a pop operation
Bro you should know what is dfa before doing this problem . Dfa is basic for this problem
But state is also changed for 2nd b,the 3rd b ,4th b and the other hand for all a...the state is same
Very good explanation mam keep it up💙
really superb explanation mam👏👏
thanks madam, your explanation of this concept too clear to understand,🎉🎉🎉
Good explanation Mam. Thank you
Mam 4:00
I get because no change of input but you change the state as q1 to q2
It’s due to pop operation
This is super helpful . Thank you so much.
What about transition table?
Man, this is the same squad you killed last month
Video name "dont make faith angry"and shot god pushed with buggy and got killed
thank you so much for your explanation, great work!
thank you so much you just saved my life maam
Q0, b, a daggara operation perform kaledu.... Kabatti state kuda change kavoddu kada.....
Watching before 1 hour of exam
Can't you just push 2 a's onto the stack?
Well explained Ma'am. Thank you so much to you for the help this video provided to me in my studies 🥺✨️🤍
Your right bro😢
can't we just push 2 a's for every a inserted and then pop a single a from the stack for every b inserted ?
Video playin in 1.25x on defaul
Does this only work with even number of b's? If it was an odd number would it not get stuck in the q2 state?
yea cause that string isnt accepted
it will also accept string aabbb which is incorrect .
Very nice and easily explained!🙌🏼😃
Hi
Wrong bro adi
thank you mam, its a great video
good job anita maam
How can I contact you mam.
I have doubts about this topic if possible can you help me mam to sort out that.
better to push to 2X for each a and remove 1X for each b … all in one state
a ❌ ye ✅
Mam can I take 1st b pop and 2nd b no change?
mam its nice,but aap ko aak step bhool he gayai 4th b ko pop krna hope aap reply krai gai agr mai galat hoon
yes even i got that doubt
excellent mam
I think you go from state q1 to q2 at last
Ellam manasilaya pole irikkam🙂
We should take only 3 states na y did we take 4 states
Toc arryer question podunga
How solve if a²n bn /n>=1
Tq ma'am 🙏 well explained
It's deterministic or non determinintic pda
Mam akkada Meeru current state ela cheptunnaru naku ardham kaledu
3:05
Thank you so much!!!!
doubt : when we have to change state from qo to q1 ?? ...if anyone knows please tell me
Whenever b occurs change 1 state and pop A from the stack
that's great for beginners but you never do three correlated variables ie: n=3m and m=4o
what about a^0 b^2*0
it says n is greater or equal to one
Good explanation for easy understanding thank you mam
Where is the 4th b❓❓❓
as maam already write transition for that she leave it ,like on input 3rd b state changes from q2 to q1 and for q1 pop operation is already written
mam your video in explain question and my question👇 Also same or not
PDA
L={0^n 1^2n | n>=1}
same
What if n=>0
Thanks ma'am 😊
Yes guys the solution is correct
Thank you so much!
You written wrong at last step, you taken only for 3 b's, missed one step
Ma'am 4 th b???
Thank you
Thanks anita
mam thank you
A or yeh?
Thanks
Thanks ma'am
ty
Mam not ye it's 'a' I was reported confused
lov from Kathmandu
thank you:)
hi am frm pakistan ur r great teacher i like ur way keep it up but i feel little difficulty in ur accent
Go make bombs
Hyy samina how r u I'm from 🇮🇳India
Is this right or wrong??📌
So was it right or wrong lol
hello south indian mam
turn off auto focus!
Bashirian Estate
yay
wowww
but quick
hindi may lecture day
Hindi m hi bollo🌝
wrong answer
check it carefully
Nope, it's right... check carefully! :D
xD..it is correct..
Loser
Not explained well
first understand yourself what you are saying
You are not good and not clear uff
your camera constantly zooms in and out it is really annoying. please do something about this...
Worst
This is super helpful,
Thank you so much.
4:55