   Chapter 12.1, Problem 30ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# 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.30. ( r s ) * and ( ( r s ) * ) *

To determine

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 )*)*

Explanation

Given information:

Let r,sand t be regular expressions over ={a,b}.

Concept used:

The two regular expressions can define the same language.

Calculation:

The two regular expressions define the same language.

L( ( rs )*)=(L( rs))*=(L( r)L( s))*=(rs)*=={x/xis the concatenation of finite number of strings  in the set {rs}}={,rs,rsrs,rsrsrs,.........

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 