I don't have one yet. But the basic idea is to use a PDA and a DFA, and suppose that we have transitions of the form q --- a, x->y ---> q' in the PDA, and r --- a ---> r' in the DFA. Then in the corresponding PDA, make transition (q,r) ------- a, x->y ------> (q', r') because the DFA is just a PDA without any stack operations. (To really finish this off though, you need to think what happens with the epsilon transitions, since the DFA doesn't have those.)
![I.N "HALLUCINATION" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/n5B5q1Hwt_U/mqdefault.jpg)
Next video! Chomsky Normal Form (CNF) conversion: ruclips.net/video/-SZkkMWHBvQ/видео.html
Ryan, what video are you discussing for the same proof but using a PDA? Could you please share me the link?
I don't have one yet. But the basic idea is to use a PDA and a DFA, and suppose that we have transitions of the form q --- a, x->y ---> q' in the PDA, and r --- a ---> r' in the DFA. Then in the corresponding PDA, make transition (q,r) ------- a, x->y ------> (q', r') because the DFA is just a PDA without any stack operations. (To really finish this off though, you need to think what happens with the epsilon transitions, since the DFA doesn't have those.)
your presentation in this video is so dry, i suggest you remake this