Theory of Computation: PDA Introduction with Example (0^n 1^n)

[@nagasrikuncharapu3736]

Within 30min you explained 100 pages of content. Thanks a lot ma'am.

[@elenavalsecchi]

Very helpful i have to say. I appreciate the fact that you always support the theory with a practical and complete example, that clarifies a lot

[@vamsisarella9693]

Very well explained. Explanation very clear and understanding.

[@batuhanb1544]

Bu videoyu internette BEDAVAYA paylaştığınız için size çok teşekkür ederim! Sabancı Üniversitesinde verilen "CS302 Formal Languages and Automata Theory" dersine sizin sayenizde rahatça çalışabiliyorum. İyi ki varsınız, iyi ki bizlesiniz. Sevgiler, saygılar...

[@ninagutovska8653]

Great explanation, very clear, thank you for your work!

[@samarlabidi2863]

thank you very much your explanation is very simple and makes me understand everything without any complications

[@042_dikshasakhare6]

Extremely helpful. Thankuuu mam.

[@meghaanju133]

Clear explanation ty

[@user-tf3dm2if6u]

very helpful thank you

[@govindjangid6201]

Thanks ma'am 😊

[@keerthana234]

Thanks a lot Ma'am!!!

[@somalasresthasomala8974]

thank you so much mam...

[@a8488vv]

Thankyou so much ma'am 😊

[@m.karthik7407]

Thanks mam

[@rivamak]

hi ,can you do Consider a PDA that accept: L = 0n 10n where n ≥ 1

[@deepthim66]

Thank you Ma'am 😊

[@deadskull.18]

Mam can't we stay in same state qo for poping 1 and after epslon came go to another state

[@sanduminikarunarathne5750]

❤❤

[@kapilbhati4293]

Thanks mam😊😊

[@akarshbobbili8054]

If you share the notes it would be really helpful mam

[@mutasimbellah7260]

8:40

[@govindjangid6201]

Thanks ma'am 😊