Timeline for How to prove that if $L, G$ are regular languages then $\{w\in L|\exists x\in G: |x|=2\cdot |w|\}$ is a context-free language?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 28, 2019 at 15:03 | vote | accept | Yos | ||
| Jan 28, 2019 at 12:14 | answer | added | Yuval Filmus | timeline score: 4 | |
| Jan 28, 2019 at 10:43 | history | asked | Yos | CC BY-SA 4.0 |