   Chapter 12.2, Problem 37ES ### 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 29—47, design a finite-state automaton to accept the language defined by the regular expression in the referenced exercise from Section 12.1. 37. Exercise 26

To determine

Design a finite-state automaton to accept the language defined by the regular expression in the referenced exercise from Section 12.1.

Explanation

Given information:

The language consisting of 0's and 1's with an odd number of 1's.

Concept used:

Arrow in the given graph played vital role in answer selection.

Calculation:

Design a finite state automaton to accept the language defined by the regular expression

(a|b)*b(a|b)(a|b).

The input symbols of the automaton A are a and b, and has four distinct states:

s0: Initial state that represents (a|b)*. This state accepts the symbols a and b in any order till the third symbol from the end is encountered as shown below.

s1: State to which A goes when the input string contains the third character b from the end

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