Solved: Let r,s, and t be regular expressions over = {a, b}. In 2830 determine whether
Chapter 12, Problem 29(choose chapter or problem)
Let r, s, and t be regular expressions over \(\Sigma=\{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.
\((r s)^{*}\) and \(r^{*} s^{*}\)
Text Transcription:
(Sigma=a, b)
(r s)^*
r^* s^*
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