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 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 19, 2012 at 7:25 | comment | added | Bartosz Przybylski | I guess not because you assume that S might be empty string. In empty string number of b is even. Also you are missing X in your comment grammar. And looks like you won't be able to get to babb | |
| Oct 19, 2012 at 7:22 | comment | added | user3115 | ah I see how you got that, thanks for the help! Hmm, would something like this work as well? S->YYb|empty, Y-> aX|bbX|empty | |
| Oct 19, 2012 at 7:19 | vote | accept | CommunityBot | ||
| Oct 19, 2012 at 7:14 | history | answered | Bartosz Przybylski | CC BY-SA 3.0 |