   Chapter 12.3, Problem 3TY ### 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
12 views

# Given states s and t in a finite-state automaton A, s is 0-equivalent to t if, and only if, either both s and t are or both are . Moreover, for every integer k ≥ 1 ,   s is k-equivalent to t if, and only if, (1) s and t are ( k − 1 ) -euivalent and (2) .

To determine

The condition that finite-state automaton A, should satisfy to be s sand t are * equivalent where the eventual function is N* and s and t are states in A.

Explanation

Given information:

Given s and t are two states for a finite-state automaton A.

Consider two states s and t in the finite-state automaton A.

Let w be an accepted string by the automaton,

When s is k equivalent, we can observe that the length of the string w is less than or equal to k

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