Timeline for Can we further minimize this regular expression: a*(ac* + bc* + cc* + b*bc* + b*cc* ) + b*(bc* + cc*) + c*
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 29, 2022 at 8:22 | comment | added | Arun Madhav | @PratikHadawale I don't know of any identity for minimizing regular expression, so it would be the most logical thing to do as $r$ is the union of $a^{*}b^{*}c^{*}$ and subsets of $a^{*}b^{*}c^{*}$ hence we don't need to consider the subsets but in the case $a^{*}bc^{*}$ and $b^{*}c^{*}$ neither of them is a subset of the other hence we need to consider both of them. | |
| Dec 29, 2022 at 8:15 | comment | added | whoisit | @PratikHadawale This is incorrect. aabbcc belongs to abc* but doesnt belong to either of the previous ones. | |
| Dec 29, 2022 at 5:16 | comment | added | Pratik Hadawale | do we just state this as the most logical thing to do? or is there an identity for it? Like a* b c* says "we need exactly 1 b" whereas b* c* says "we can have 0 bs and no as" | |
| Dec 29, 2022 at 4:29 | history | answered | Arun Madhav | CC BY-SA 4.0 |