Timeline for Regular expression for binary words with few zeros
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2013 at 13:35 | answer | added | Khaur | timeline score: 1 | |
| Feb 3, 2013 at 19:12 | comment | added | Jay Teli | Sorry .. that i didnt show what i tried ... but this question is INTERESTING for me BCOZ the same language has DIFFERENT Regulalar Expressions depending on values of m and n ....See vonbrand's answer for details.... | |
| Feb 3, 2013 at 19:07 | vote | accept | Jay Teli | ||
| Feb 3, 2013 at 16:02 | answer | added | vonbrand | timeline score: 2 | |
| Feb 3, 2013 at 10:21 | history | edited | Raphael | CC BY-SA 3.0 |
formatting, language, tags, title
|
| Feb 3, 2013 at 10:18 | comment | added | Raphael | Why is this interesting for you? What have you tried? | |
| Feb 3, 2013 at 8:20 | history | migrated | from cstheory.stackexchange.com (revisions) | ||
| Feb 3, 2013 at 2:25 | history | asked | Jay Teli | CC BY-SA 3.0 |