Timeline for Are regular and context free languages closed against making them prefix-free?
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 11, 2020 at 12:41 | answer | added | mianfg | timeline score: -1 | |
| Jul 26, 2013 at 2:39 | history | tweeted | twitter.com/#!/StackCompSci/status/360590169264496640 | ||
| Jul 22, 2013 at 19:06 | comment | added | sdcvvc | You can fix the example by taking $\{0^i 1^j \$ 2^n\}$ | |
| Jul 22, 2013 at 18:20 | history | edited | Robert777 | CC BY-SA 3.0 | added 52 characters in body |
| Jul 22, 2013 at 16:36 | comment | added | Raphael | In your example, $A(L)$ is empty since for every $0^i 1^j 2^n$, $0^i \in L$ is a prefix. | |
| Jul 22, 2013 at 16:33 | answer | added | Raphael | timeline score: 7 | |
| Jul 22, 2013 at 15:48 | vote | accept | Robert777 | ||
| Jul 22, 2013 at 15:48 | comment | added | sdcvvc | "create a new NFA by making all accepting states sinks" You can replace here NFA with DFA. | |
| Jul 22, 2013 at 15:22 | answer | added | sdcvvc | timeline score: 7 | |
| Jul 22, 2013 at 15:21 | history | edited | Robert777 | CC BY-SA 3.0 | added 9 characters in body |
| Jul 22, 2013 at 15:13 | history | edited | Robert777 | CC BY-SA 3.0 | added 341 characters in body |
| Jul 22, 2013 at 14:32 | comment | added | Yuval Filmus | You are answering your own question. Can you clarify what it is that you are not sure of? Try working out the proof to see if it works. | |
| Jul 22, 2013 at 13:57 | history | edited | Raphael | CC BY-SA 3.0 | added 12 characters in body; edited tags; edited title |
| Jul 22, 2013 at 13:54 | history | asked | Robert777 | CC BY-SA 3.0 |