Timeline for A context-free grammar for all strings that end in b and have an even number of bs
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2019 at 0:00 | history | tweeted | twitter.com/StackCompSci/status/1140408836987207681 | ||
| Dec 25, 2018 at 16:07 | answer | added | Coder | timeline score: 0 | |
| May 21, 2018 at 13:31 | history | edited | reinierpost | CC BY-SA 4.0 |
fix the title
|
| Oct 22, 2012 at 13:47 | answer | added | Raphael | timeline score: 1 | |
| Oct 22, 2012 at 13:45 | comment | added | Raphael | Why don't you create regular grammars? | |
| Oct 22, 2012 at 13:45 | history | edited | Raphael |
edited tags
|
|
| Oct 19, 2012 at 7:19 | vote | accept | CommunityBot | ||
| Oct 19, 2012 at 7:16 | answer | added | A.Schulz | timeline score: 4 | |
| Oct 19, 2012 at 7:14 | answer | added | Bartosz Przybylski | timeline score: 1 | |
| S Oct 19, 2012 at 6:59 | history | suggested | Bartosz Przybylski | CC BY-SA 3.0 |
fixed formula formatting
|
| Oct 19, 2012 at 6:58 | review | Suggested edits | |||
| S Oct 19, 2012 at 6:59 | |||||
| Oct 19, 2012 at 6:49 | history | asked | user3115 | CC BY-SA 3.0 |