Is $$ 0((01+0)^+(0+10)1) = ((0+01)^+(01+101))^+1?$$
I think it's not , because the language generated by the regular expression on the left accepts the word 00101, but the language on the right doesn't accept it. Am I right?
Is $$ 0((01+0)^+(0+10)1) = ((0+01)^+(01+101))^+1?$$
I think it's not , because the language generated by the regular expression on the left accepts the word 00101, but the language on the right doesn't accept it. Am I right?
Copyright © 2021 JogjaFile Inc.
Yes, you are right. In fact, all words described by the expression on the right hand side end with
11; on the other hand, all words described by the expression on the left hand side end with01. Thus the languages described are even disjoint.