#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

For every pair of regular expressions R and S, the languages denoted by R(SR)* and (RS)*R are the same.

Answer

TRUE