Timeline for Regular expression for words over $\{0,1\}$ containing at least one 1
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 9, 2018 at 18:11 | comment | added | David Richerby | Thanks, Rishabh -- you're absolutely right. I've fixed that, as you suggested. | |
| Sep 9, 2018 at 18:10 | history | edited | David Richerby | CC BY-SA 4.0 |
Fix pointed out by Rishabh Jain
|
| Sep 9, 2018 at 18:01 | comment | added | Rishabh Jain | The second representation in your answer cannot generate 111 string!!!. You need a kleen star there too | |
| Dec 7, 2014 at 20:04 | history | edited | David Richerby | CC BY-SA 3.0 |
Clarified equivalences.
|
| Dec 7, 2014 at 14:54 | comment | added | babou | I agree with this complete analysis. One quality criterion is that explaining the regular expression is simple, or better that a correctness proof is simple. Another criterion could be the star height which is a measure of complexity of the regular expression. Your solution has star height 2 (because you have a star over a subexpression that already has one), when other solutions have star height one. But knowing this can hardly be expected from beginners. Possibly you teacher misread the answer ... can happen. Can you ask what you did wrong? | |
| Dec 7, 2014 at 14:15 | history | answered | David Richerby | CC BY-SA 3.0 |