Timeline for Is there a *simple* proof that the intersection of a CFL and a regular language is a CFL?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 27, 2018 at 12:26 | comment | added | Thinh D. Nguyen | This exercise may help the OP if he/she already understands what is going on in the proof for DFA. But of no help, when he/she still has not figured out the cross product in your answer. Because, in that case, there is no second stack to be added to the picture. | |
| Oct 27, 2018 at 12:24 | comment | added | Thinh D. Nguyen | For the additional exercise, it is obviously impossible to merge two stacks, which may differ vastly in length when the two PDAs run. | |
| Oct 27, 2018 at 12:04 | history | answered | Pseudonym♦ | CC BY-SA 4.0 |