   Chapter 12.1, Problem 16ES ### 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

# In 16—18, write five strings that belong to the language defined by the given regular expression. 16. 0 * 1 ( 0 * 1 * ) *

To determine

Write five strings that belong to the language defined by the given regular expression.

0*1(0*1*)*

Explanation

Given information:

The regular expression is

0*1(0*1*)*

Concept used:

Write the arbitrary strings for the expression 0*1(0*1*)*

Calculation:

It is required to give five strings that belong to the language defined by the given regular expression 0*1(0*1*)*. Here * in the exponent represent Kleen closure of the expression that is it denotes the concatenation of expression or variable with itself any finite number (including zero) of times. Using the definition of Kleen closure five arbitrary strings can be written as follows

1. 1 (Zero string of 0* and zero string of (0*1*)* being considered in this case)

2. 0101 ( 0 Is considered from 0* and 01 from (0*1*)* )

3

### 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 