Timeline for Does every regular expression describe only 1 language?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 10, 2023 at 12:49 | comment | added | Nathaniel | A regular expression is a sequence of symbols. Two regular expressions with different sequences of symbols cannot be equal. However, the language they describe can be equal. That's why I am talking about the interpretation of a regular expression, denoted $\mathcal{L}(e)$. Though one can sometimes write something like $(a+b)^* = (a^*b^*)^*$, this is an abuse of notation that, in reality, means $\mathcal{L}((a+b)^*) = \mathcal{L}((a^*b^*)^*)$. | |
| Jan 10, 2023 at 12:27 | comment | added | Pratik Hadawale | Oh my bad, i thought your gave an example for the "a regular expression is equal to inifinite other regular expressions". Thank You! and sorry for misunderstanding | |
| Jan 10, 2023 at 12:26 | comment | added | Nathaniel | "it's also possible to have two completely different regular expressions describing a regular language correct?" > that's litteraly what my answer prove. | |
| Jan 10, 2023 at 12:20 | comment | added | Pratik Hadawale | Yes!! One more doubt regarding what you said ~ it's also possible to have two completely different regular expressions describing a regular language correct? Asking because different methods like arden's or state elimination method produce different expressions. Even in Arden's theorem, sometimes the order in which we substitute leads to different expressions. According to me, it's possible | |
| Jan 10, 2023 at 12:17 | vote | accept | Pratik Hadawale | ||
| Jan 10, 2023 at 10:53 | history | answered | Nathaniel | CC BY-SA 4.0 |