Timeline for How to prove using pumping lemma that language generated by a(b*)c(d*)e is regular?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 24, 2018 at 14:04 | comment | added | Jasmijn | @ratchetfreak That example contained $b^{j^2}$, the regex you supplied replaces that with $b^{2j}$ | |
| Aug 24, 2018 at 12:26 | comment | added | ratchet freak |
The language you gave as an example of a non-regular language is regular with regex: (a*(bb)*)|b*
|
|
| Aug 23, 2018 at 14:57 | vote | accept | V K | ||
| Aug 23, 2018 at 14:48 | vote | accept | V K | ||
| Aug 23, 2018 at 14:53 | |||||
| Aug 23, 2018 at 14:48 | vote | accept | V K | ||
| Aug 23, 2018 at 14:48 | |||||
| Aug 23, 2018 at 14:46 | vote | accept | V K | ||
| Aug 23, 2018 at 14:48 | |||||
| Aug 23, 2018 at 14:42 | history | answered | Yuval Filmus | CC BY-SA 4.0 |