   Chapter 12.3, Problem 16ES ### 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

# Prove property (12.3.6).

To determine

To prove:

That if two states in a finite-state automaton are k equivalent then these states are * equivalent.

Explanation

Given information:

For a finite-state automaton, there are two k equivalent states for every integer k0.

Proof:

Let A be a finite-state automaton that has a set of states S. Suppose s and t are two states of S

If s is k equivalent to t, sRkt then the eventual function Nk for an input string w that the length is less than or equal k where k0.

Nk(s,w)Nk(t,w)

If Nk(s,w) is a non accepting state, then Nk(t,w) is also a non accepting state.

Or,

Nk(s,w) is an accepting state, then Nk(t,w) is an accepting state

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