   Chapter 12.1, Problem 25ES ### 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 25—27, find a regular expression that defines the given language. 25. The language consisting of strings of 0’s and 1’s with an odd number of 1’s. (Such a string is said to have odd parity.)

To determine

Find a regular expression that defines the given language.

The language consisting of all strings of 0's and 1's with an odd number of 1's (Such a string is said to have odd parity)

Explanation

Given information:

It is required to find regular expression that defines the given language in words. “The language consisting of 0's and 1's with an odd number of 1's ”.

Concept used:

Every string in the language starts with 0's and 1's with an odd number of 1's

Calculation:

It is required to find regular expression that defines the given language in words. “The language consisting of 0's and 1's with an odd number of 1's ”.One of the possible solution for the above statement is

0*10*(0* 10* 10*)*

The part 0*10* consist of strings of 0's and exactly one 1

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