0

If we have a regular expression $R$, will $R$ describe only regular language $L$, but that language $L$ can have multiple different regular expressions such as $Q,W,A,S,D \ etc..$ describing it

Also, $R$ can be equivalent, in terms of describing $L$, to infinite regular expressions including $ Q,W,A,S,D \ etec..$

Is my understanding correct?

Pratik Hadawale
  • 335
  • 4
  • 15

1 Answers1

0

If $e$ is a regular expression such that $\mathcal{L}(e) = L$, then so is $e+\emptyset$, $e+\emptyset+\emptyset$, …

Nathaniel
  • 18,309
  • 2
  • 30
  • 58