Timeline for How do I find a regular expression for a particular language?
Current License: CC BY-SA 3.0
5 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/
|
|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Sep 3, 2015 at 8:43 | comment | added | Raphael | While correct, this is disappointing standing alone: since regular languages are often defined via regular expressions (i.e. inductively), one should hope that there are patterns/heuristics that allow to come up with one directly. (Myself, I think I'd always go via automata. I think I have a useful answer in that vein, but that should probably go to the "how to prove regular" question?) | |
| Aug 25, 2015 at 20:30 | history | edited | D.W.♦ | CC BY-SA 3.0 |
added 320 characters in body
|
| Aug 25, 2015 at 20:22 | history | answered | D.W.♦ | CC BY-SA 3.0 |