63 questions linked to/from How to show that L = L(G)?
45 views

Language to regex

Let A={a,b}. So the question is to write regular expression such that L(r) which consists of all words. My answer is this: L(r)= (a+b)* a* b* (a+b)* Is this ...
The book that I'm reading says it is equivalent But what about the aa string ? i produce it this way : $$S\Rightarrow S_1B\Rightarrow aS_1bB\Rightarrow aaB\Rightarrow aa$$ But that language doesn'...