TOC | PDA | Introduction to PDA and Examples | 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
( b, b / aa ) at the q0 state is wrong.
it should be (b, b / bb) .
but thanks for your courses, it helps me a lot .
looking forward to having more courses on other computer subjects.
+Hokas Pokas I noticed that too and I think it is a typo
atleast you understood what should there be instead of a,a.. you should probably be thankful.
solta le kahile bhyako yo sab??
Arrey Gahlot.. kayy karray sayy bhai.. dhyann dayy padhai nayy....(b,z/bz) iska case bhi to soch iske next mayy b aayega to kayy karega...
yep it should be (b,b/bb) cause we are pushing b again in the stack if its not empty and contains b's in it
Description: Push down automata, its state configuration and transition model.
You. I like you.
feature sky MVP
My man
feature sky tgbbbn👑
Our professor teaches the same by looking at your videos.But your lecture is easier to understand.This shows that it needs more than just knowledge to teach the things.
same here
Taught what my college taught in 4 hours in 20 minutes . Hats off
actually 28:53 minutes
@@kaustubh_ramteke_07 You must be fun at parties
@@harishsundar3409 As someone who has been in a party with him, i can confirm he is very fun at parties. 🥳🎉🎉🪅
Man, you are just awesome !! I don't understand why professors teach us only the theory ! It's easier to understand by example !
sir has done mistake at 21:10 yaaaaaaaa,it should be (b,b/bb) at q0 state
wish our proffs. could teach us like this
21:10 it should be ( b , b /bb )... I think...
sir i think u made mistake 17:14 u said that NDPDA = DPDA but that is wrong...NdPDA and DPDA are different in power because there is some language present that is accepted by ndpda but not accepted by dpda ex:L={wwR| belongs to (a, b) *}
He said by considering that example only
Ravindra Jee aap cha gaye pura Bangladesh mein
this video helped a lot to prepare for my semester exam
sneha kumari mee too
ha yaar gajab knowledge hey sir ke pass
Super Videos Ravula Sir!!! They have been really really helpful to me and to all my colleagues in understanding TCS ..Great Job Keep it up!
Great lecture ! it would help if the the title has the name of the lecture in bracket (like this one) (PDA)
No matter how many videos I had watched previously I could understand any topic related to computer science gate only after watching your videos. And thank you for all your efforts. God bless you sir.
Ravindra ravula sir... Son of a gun... Ur teaching is best i have ever seen... My respect to you and David J Malan... I consider u 2 people as teaching icons.
And i am humble to see all ur lectures.. But the only thing to regret is that ur full lecture cost is too high.. And i cant afford it 😟😟... Any way i wont blame u... U r just asking for fruit for ur hardwork.. Its ok...
What a lecture sir!
Hats off! Lecturers like you are a need in modern education system of india.
You sir, are my favorite. You've always helped me through all the test and all the exams. Especially these Automata Theory concepts. they're very clear. Thankyou so much.
sir you have told in this video (around 17:00 mins ) that DPDA and NPDA both have eqiuvalent power but i think NPDA is more powerfull than DPDA... correct me if i am wrong kindly...
Yeah Npda is more powerful then DPDA
He said in his next video that npda is more powerful than PDA...i.e lecture no 70... in time 18.10..
@21:08 Perhaps, u meant to write (b,b/bb) isn't it!?
Thank you sir for your free courses and video on UA-cam... It helped me a lot in my gate and ugc net exam preparation 🙂......
Thank you so much sir. this was very helpful for me. only on mistake (b,b/bb). i know this was mistake.
in the last example, in the final state, if we encounter c on c would the machine halt or accept it.
This solution looks like the minimal configuration of what this PDA's complete counterpart would look like. ...
Sir tussi great ho ji 😍😍menu auromata naal pyaar howe gya tuwade videos vekh ke
yaaaaaaaa,it should be (b,b/bb) at q0 state
+roushan raj at which time?
at 21:04
ya,bro
+roushan raj
yes you are right
u r right
24:00 he meant to say C+ or CC* not C*, because there is at least one c
it must be c+
It's fantastic lecture..i had seen your every video lecture on FA,DFA,NFA, Grammer, etc... n must say teach soo well...thanx
not all heroes wear capes!! good job!!
Thanks for providing me great lectures ... :) Your lectures always remain very useful for me..
I mostly cover my all university courses through your lectures .... Thanks again...
sir can you plz upload lectures of turing machine?
+Pooja B Sen Really need it. By tonight.
I am very late to reply but , turing machine lectures are in his full course.
@@sachinpal2424 can u share the full course of tcs plxxxx my exams are near ..and i cant afford to pay for his lectures
@@hhcbin3540 Sorry i don't have it now. But i can assure you, he has covered a major portion of the syllabus of TOC, which would be sufficient to pass your semester exam easily.
Clicking on all the ads. Much grateful for this content.
Great you should have differentiated between the stack alphabet symbols and the input alphabet symbols @ around 6:30 ....
According to your definition PDA is 7-tuple. It makes sense to differentiate the two set of symbols. Some students will mistake pushing the inputs characters unto the stack which is not the case.
sir plz tell.. (a,a/aa) and (b, b/aa) is it correct????? i think it should be (a,a/aa) and (b, b/bb) ???
(request)hello if you have watched the algorithms videos sir has taught the merge sort very differently is it correct
yes, it will be (b,b/bb).
Hardeep, u r right that was mistakenly written(Even sir says 'b' should be saved onto stack).Just take one example to get sure.
At Sir 21.36 minute there is one small mistake is there sir.
(b,b/bb)
You are a really great teacher sir. You make learning so much easier. Thank you 😁
thanku sir..lectures r v v helpful and comprehensible...i signed in for the first time only to thanku..stay blessed.
At time 17:11 you said that DPDA and NPDA are equal in power, but NPDA is more powerful than DPDA. Also in TOC-70 lecture at time 18:11 you said that NPDA is subset of DPDA which is wrong, DPDA is subset of NPDA is correct.
I'm having a few doubts regarding the epsilon transition at the end of a^n b^n PDA. Doesn't that make a string like aabbb be accepted?
Great lecture... learnt a lot of new things. Keep going Sir.
Hi, @21:04 it should be (b, b | bb). If we see b and top of the stack is also b then we should push bb in the stack right? because at 21:04 you have written (b, b| aa) on reading on b and top of the stack is b then we are keeping aa as it is.
In the second example, when you input 'b' and 'b' is on top of the stack, then we need to save the 'b' so that stack contains 'bb' right? But you have saved 'aa'. Why so?
super lessons and audibility is pure
i reaLLY LIKE IT AND ALLWAYS WATCH YOUR VIEDO
Thank you sir. Though there is one error, its your lecture that helped me to learn the concept and because of that only i could figure out the mistake, (q0,b,b) = (q0,bb).
You saved me from my exams!
no words to appreciate this....fabulous ,,
Thank you so much for your videos on thoery if computation! It was very helpful for me !! Thanks again
but sir if we take 1 to power 0 and 0 to power 0 then first state shoudl directely go to the final state so there can be loop dont you think this E , z0/z0
Your videos are amazing! Would be much easier to find them if you titled them! Thank YOUUU
Thanks a lot sir, it helped me in my semester exam todey!!!!!
18:29 it is different from a^nb^n also because we can get epsilon in w string??
At 2:40 you said if you see input alphabet OR epsilon - only one can be defined as a transition....but how comes at 15:47 , for q1 you have both b and epsilon as transitions?
Am I missing something or understanding incorrectly?
east or west....sir you are best 😊
22:58 is wrong
the problem states that n >= 1 while his PDA accepts n = 0,
see when we input nothing, we directly go to final state.
aqua123670
lol
he has said no where tht n>=1 for tht problm, he has described the previous problem there..
Sir on 17.16 minute ,you have said that NDPDA and DPDA are equal in power? But how it's possible as we know we can make copies of machines in non deterministic and many differences are also there in these two so how it's possible?????????
Thats very helpful sir.Thanks alot...
In the last example a^nb^nc^m, why do we draw a new state for the input c? Can't we manage it in the second state itself? Cause even if b comes after c (example string aaabbbccbc) , there is no transition defined on (b,Zo/pushdown string). That means we can just have a final state for empty string right?
+apurwa jadhav "m" has to be greater than 1 as mentioned in the question. If we go according to your point of view im pretty sure it might end once we pop all the a's out. But still we wont have a way to reach the final state :/
Interesting question.
apurwa jadhav mam I don't think that "b" doesn't comes after "c" bcoz it will not be accepted and it will halt (mentioned in ur example that "b" comes after "c")
NPDA is more powerfull than DPDA,there exist some context free languages which are accepted by NPDA but not DPDA..and yup everyone is correct about the mistake about b,b/bb..still great lectures ..super stuffs!!
@17:12 I think, power of NPDA > DPDA, since there are some languages which are accepted by NPDA but not by DPDA.
Yes, in next lectures he said NPDA > DPDA.
lot of thanks .......
awesome video.........easy to understand
one of the best description
thankyou soo much sir,you explain really really welll....
can somebody plz tell me that in last example a^nb^nc^m how many number of states will be there if we use acceptance by empty state??
21:10 doesnt this PDA also accept E(epsilon)?
Zero times a and zero times b is also accepted which doesnt satisfy the condition n>=1
The best vids for b.tech students.
How is @17:26 deterministic if theres no edge from q1 to any 'a' input? It only covers b and episolon, twice.
your lectures are too much helping
sir i have a doubt at 21:11 ,whether it is (b,b/aa) or (b,b/bb)?
At time 11:16, why we are not poping in the same state is not understandable.plz help me
is Zo fr bottom of stack or the top of the stack????? m getting confused
'
+Krishna Gaur
if no element is present then z0 is the top most element in the stack,else last pushed element is top most element of the stack
great class, very nice explanation. Congrats!
Sir, in this vedio I think their is a mistake.(i.e) if b is the input and b is on the top of the stack then bb remains as it is.please check and tell me the correct answer
Sir what will be pda for L={ a^ib^j | i
I need to write the rule productions of for loop statement (in c language and Fortran language) as a context free grammar to parse strings such as
(For(i=0;i==9;i=i+1) statement; (in c language)
do n i=0,9,2 statement (in fortran)
Thank you sir for the rapid and meaningful lectures it helped me lot #life saving #liked #subscribed
Sir, here n>=1,so how could you make all the transaction in only one initial state ?
Thank You 👍 videos are really very helpful
your description says "Description" and while that's true, it could be more informative. Please fix.
SIr, DPDAs are realistic, we can construct a machine but where as NPDA not. If we are not able to convert from NPDA to DPDA what is the use of NPDA
Sir, can u upload Turing machine tutorial??
Plz upload the complete series....Turing machine and all
My question is- a power n & b power n is a Dpda Or Ndpda????? Plss tell me
In the last example why we r not pushing c more than 1 time? ... m may be 2 then what .... i mean why there is not (c,c/cc)..
so lucidly explained sir..... thanks a tonnnn :)
at 25:20 we could have made transaction (c,z/z) on q1 state itself rather than making a new state
u mentioned that both NPDA and DPDA are equivalent in power.
how is it possible ?
for recognising both even and odd length pallindromes DPDA isn't enough ,NPDA can solve this.
Is there a limit to stack capacity in a pushdown Automaton? please answer..
please add subtitles makes it easier to make notes.
very nicely understood man
crystal clear!!!thumbs up..
Superb explanation sit
Sir, kindly make/Upload some lectures on Turing machines.
Nice explanation of push down automata
(b,b/bb) at q0 state
Excellent demonstration...yes he committed a small mistake but easily understandable
Very helpful videos!
For anyone looking for the topics covered in this video → He has covered PDAs from scratch
Please comment on the other videos too where the titles are missing
can you upload lectures of Compsky normal form and Greibach normal form?
Sagar Goyal he has already done those topic videos..u cn check in his playlist
Not gnf only cnf Is there
i think at 21.10 something goes wrong,it should be (b,b/bb) maybe.
Can you upload a video of conversion of Context Free Grammar to push down automata. i.e CFG TO PDA?
10/10 best tutor
can you explain a raise to n b raise to 2n / n >= 0 PDA accepting by empty stack