Theory of Computation: Conversion of PDA to CFG

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

THANK YOU! I've never felt so thankful ever before. Such a life savior video it is.

SakshiPratap
Автор

Best explanation ever! Thank you very much!

julianwagner
Автор

Top most video clearly explained (Meeru thopu madam) in Telugu

AbdulWahid-fqft
Автор

thanks mam ..i couldnt understand this when my prof told now i understood how to do

roshini
Автор

Awesomely explained with concept. Mam where were till now. Thank You mam, try to make more videos it will help us a lot.

twospartansgaming
Автор

One of the best explanation, thankyou

rhunnandwightliao
Автор

Thank u so much.I understood very clearly

gopavaramsaimadhuree
Автор

better than 1000 professor i saw, thanks...<3

abdulsatarsayed
Автор

Mam if we have 3 state so how many state?

GleamTrend
Автор

You should have given a separate name or bar for both (q).
Because it is very confusing when you started doing the problem . Although I understood the first part very well

riihnif
Автор

Very well explained, all into detail. Great video

leonelliottfuller
Автор

#Explanation level is awesome mam
#Hats off....

avishkargaikwad
Автор

Really elaborated.
thank you ma'am☺️

katyayanipatna
Автор

Mam I hav a doubt!!
In cfg to pda
Is it necessary for the cfg to be converted into gnf then do the pda .
Or simply can we usee the same prdctions give. In question.

Plz help!!

richardparke
Автор

Excellent teaching mam… thank you Soo much 😊

keerthireddy
Автор

better if transitions also write in video itself

KadiriRamanjaneyareddy
Автор

The example is soo confusing as u have taken q in two parameters

sarojnareshdalwani
Автор

u missed the part where you have to remove the useless productions

samratpatel