Let r, s, and t be regular expressions over = {a, b}. In
Chapter 12, Problem 30E(choose chapter or problem)
Problem 30E
Let r, s, and t be regular expressions over ∑= {a, b}. In 28–30 determine whether the two regular expressions define the same language. If they do, describe the language. If they do not, give an example of a string that is in one of the languages but not the other.
( rs )∗ and ((rs)∗)∗
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer