Lec-52: Design PDA for {w | na(w) = nb(w)} CFL language | Pushdown automata | TOC

In this video Design PDA for {w | na(w) = nb(w)} CFL language is explained i.e. how to design PDA when a language is given to you. Important points related to this topic are discussed here.

►Theory of Computation (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Database Management System:
► Software Engineering:
►Artificial Intelligence:
►Computer Networks:
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Programming in C :
►Data Structure:
►Computer Architecture :
►Graph Theory (Complete Playlist):
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

[gunjanchoudhary]

You are too good sir. I am preparing for UGC-NET 2020 and your videos are really helpful.

[richasalan]

Sir why states does not change when we take 1 as a input ??? In other videos we change our states also when we change input ...

[rvr]

Sir, I think, if we take a language which starts with 1 e.g. 1001, then in this case your PDA cannot POP the first 1 as initially z0 was in the stack.

[sidrakanwal]

Happy teachers dayy ..only just because of u me and my friends a able to pass ourr examm..

[ankitadas]

Sir when we have to change the state??...in previous video we learnt that, when new input come at q0, we should change the state...but in this case why it doesn't happen sir?? Can you please explain sir!!!

[anmolpande]

can you please tell when to change the state and when not?
I am a bit confused.

[souravbhagat]

Sir computer graphics pr bhi vidoes uplaod kijye and thanks for this video

[nishasharma-snnq]

I m fully satisfy sir ...sir mcq ki video v upload kar do...practices k leyea ..thanku

[SALCEvaibhavadesara]

sir Last Transition should be ( E, z0/z0 ) but you mentioned ( E, z0/ E). sir Am i Right ? plz tell me ...
Thankyou Sir, 👍

[gyanprakashverma]

Sir please aap iss series ko jaldi complete kr dijiye

[ankitachakraborty]

If string is - 011001 then it won't get accepted by the pda but here also we have equal no. Of a & b

[lalitkumar]

Sir, jb last m € epsilon aaega as input and z0 will be in PDA goes to final input queue and stack will be empty at all or still epsilon and z0 will be exist in both? As no operation will perform for that i guess

[sawzeetmaharjan]

Y'all, why there is no change of state while doing 1, 0->E . He is doing all in one q0 state. kinda confused

[omkarsalunke]

What if the string is like 011100? It will firstly push 0, then pop 0, then what??

[Gouravkumar-lfdh]

Sir apne 1, 0/£ do baar ku likha ek hi state mai woh toh ek hi se ho jata

[vanshikasharma]

Didn't undrstnd when the state will chng

[Anshak]

Can anyone explain why (1, 0/E) is repeated twice

[prathameshthikane]

How to accept 100110 in above question

[crazyboy-gwrk]

Sir your solution is incomplete, please add 1001 type case

[LuciferDevill]

Sir ji Apne state kyu nhi change kiye h.