Timeline for How to show that a language {w|ww^R in A} is regular, A being regular?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/
|
|
| Sep 27, 2016 at 23:12 | vote | accept | pclock | ||
| Sep 27, 2016 at 7:44 | comment | added | Raphael | To make this explicit: use non-determinism heavily. You can determinise it away after, if you want. | |
| Sep 27, 2016 at 2:24 | history | answered | Hendrik Jan | CC BY-SA 3.0 |