   Chapter 12.2, 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 each of 20—28, (a) design an automaton with the given input alphabet that accepts the given set of strings, and (b) find a regular expression that defines the language accepted by the automaton.25. Input alphabet = { 0 ,   1 } ; Accepts the set of all strings that end in 10.

To determine

(a)

To design an automaton with the given input alphabet that accepts the given set of strings.

Explanation

Given information:

Input alphabet ={0,1} ; Accepts the set of all strings that ends in 10

Calculation:

Given:

Input alphabet ={0,1}

Accepts all strings that end in 10

Let us design an automaton with 5 states s0,s1,s2,s3 and s4 where s0 is the initial state and s4 is the initial state and s4 is the accepting state.

s0= Initial states1=Input ends with 00 or input is 0s2= Input ends with 11 or input is 1s3= Input ends with 01s4= Input ends with 10

When we are at state s0 and the input is a 0, then we need to move to state s1

To determine

(b)

A regular expression that defines the language accepted by the automaton.

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