Timeline for Finding a regular expression for all non-empty binary strings that contain both 0s and 1s but no consecutive 1s
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 30, 2016 at 22:13 | answer | added | Daniel Martin | timeline score: 0 | |
| Jan 28, 2016 at 21:18 | answer | added | Rainer P. | timeline score: -1 | |
| Jan 28, 2016 at 19:28 | history | edited | user1764381 | CC BY-SA 3.0 |
deleted 2 characters in body
|
| Jan 28, 2016 at 18:38 | comment | added | Raphael | Note that you can use LaTeX here to typeset mathematics in a more readable way. See here for a short introduction. | |
| Jan 28, 2016 at 18:38 | history | edited | Raphael | CC BY-SA 3.0 |
added 1 character in body; edited tags; edited title
|
| Jan 28, 2016 at 18:36 | comment | added | Raphael | "This is for automata regular expression and not about Unix-style regular expression." -- Naturally, since you are posting on Computer Science and not Stack Overflow. ;) | |
| Jan 28, 2016 at 15:51 | answer | added | Hendrik Jan | timeline score: 3 | |
| S Jan 28, 2016 at 15:50 | history | suggested | DylanSp | CC BY-SA 3.0 |
Added to the title to include all criteria.
|
| Jan 28, 2016 at 14:51 | review | Suggested edits | |||
| S Jan 28, 2016 at 15:50 | |||||
| Jan 28, 2016 at 13:50 | review | First posts | |||
| Jan 28, 2016 at 14:11 | |||||
| Jan 28, 2016 at 13:49 | history | asked | user1764381 | CC BY-SA 3.0 |