Given a finite-state automaton A with eventualstate function N* and given any states s and t in A, we say that s and t are *-equivalent if, and only if, .______
The condition that finite-state automaton , should satisfy to be sand are equivalent where the eventual function is and are states in .
Given are two states and is an eventual-state function for a finite-state automaton .
Consider two states in the finite-state automaton .
Let be an accepted string by the automaton,
Suppose that when is applied on the state , the automaton goes to an accepting state and when is applied on to the state , the automaton goes to an accepting state according to an eventual function, we call these states as equivalent
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started