closure properties of DCFL

[@BECEGtirth]

I was trying to understand closure properties since last 2 days this video cleared it in minutes

[@prabalsingh8181]

@37:00 naam toh mere man me hai bahut sare jhakham taze ho jate hai

[@Star_Gazer_42]

please do mention the names so students become aware.

[@prabalsingh8181]

@@Star_Gazer_42 ​ public platform par naam nahi le sakta mai aaj kal har koi defamation case karta rehta hai bhale hi uske pass fame na ho

[@_strangelet__]

8:04 Are't both of these languages just (a+b)*, essentially making both of them DCFLs?
I think n must be >= 1 here to make 2nd non-DCFL.

[@akhileshyadav9862]

No
As if n is greater than equal to zero it means it can be some time greater than zero automatically in that case
L transpose must end with 'a'
Which you not guaranteeing

[@amritanair1734]

31:36 Is every Regular Language DCFL? Isn't it supposed to be CFL ??

[@bhavanagayathri1347]

Thank u so much sir

[@my.journal-jo3dt]

love you sir ji

[@Thakur_Abhays]

Thank you very much sir you are gem 💎for us ❣

[@pawanchoure1289]

great😊❤

[@chandanmohapatra5203]

SIR IF YOU U WILL FREE ENOUGH KINDLY MAKE A LAST 30 DAY STRATEGIES BY YOUR EXPERIENCE .BY YOUR strategies OUR NEXT 30 DAYS JOURNEY WILL BE WORTHY.....

[@abhishekmazumdar2072]

Sir I didn't understand the algo complexity question which you asked. Please shed some light.

[@AmitKhuranaSir]

Mention timestamp

[@BECEGtirth]

@@AmitKhuranaSirupper bound should be closest one to the time complexity function which is constant here

[@taneyasoni]

sir please please make videos on continuous probability only 1 month is left for GATE.

[@artisshhh]

35:00 Sir please suggest good test series from your side, agr esa hoga to kese identify krenge.