   Chapter 12.2, Problem 12ES ### 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

# Consider again the finite-state automaton of exercise 2. a. To what state does the automaton go when the symbols of the following strings are input to it in sequence. starting from the initial state? (i) 1110001 (ii) 0001000 (iii) 11110000 b. Which of the strings in part (a) send the automaton to an accepting state? c. What is the language accepted by the automaton? d. Find a regular expression that defines the language.

To determine

(a)

To what state does the automation go when the symbols of the following string are input to it in sequence, starting from the initial state?

1. 1110001
2. 0001000
3. 11110000
Explanation

Given information:

Concept used:

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

Calculation:

(i) 1110001 :Sequence of state transition starting from initial state can be written as

The eventual state in which automaton goes is s2.

(ii) 0001000: Sequence of state transition starting from initial state can be written as

To determine

(b)

Which of the strings in part (a) send the automaton to an accepting state?

To determine

(c)

What is the language accepted by the automaton?

To determine

(d)

Find a regular expression that defines the language.

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