Timeline for Simplifying regular expressions
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5, 2013 at 0:16 | comment | added | mrk | @YuvalFilmus Right. | |
| Feb 5, 2013 at 0:13 | comment | added | Yuval Filmus | @saadtaame You're right, a few details are missing. After all, it's not me who has to write the solution to the exercise. | |
| Feb 4, 2013 at 23:11 | comment | added | vonbrand | And BTW, consider that the $a b$ words can end in $a$ or $b$ (they could be even or odd length). | |
| Feb 4, 2013 at 23:07 | comment | added | vonbrand | Oh, just allow $c w_1 c w_2 c \ldots$ to start (and for symmetry to end in a $w_n$ or $c$) | |
| Feb 4, 2013 at 23:01 | comment | added | mrk | If the $w_i's$ are allowed to be $\epsilon$, you will get successive $c's$. If not, you can't start your regex with $c$ because it starts with $w_1$ which, in turn, starts with $a$ or $b$! | |
| Feb 4, 2013 at 22:16 | history | answered | Yuval Filmus | CC BY-SA 3.0 |