   Chapter 12.2, Problem 34ES ### 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. 34. Exercise 21

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:

Regular expression: (x|y)y(x|y)*

Concept used:

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

Calculation:

It is required to design a finite state automaton which accepts the language defined by the regular expression (x|y)y(x|y)*. It can be observed that the automaton accepts strings that start with xy or yy followed by any string of xs and ys. To design the automaton consider tour non-accepting states s1,s2,s3 and s4, and one accepting state s5

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