Prove property (12.3.6).
That if two states in a finite-state automaton are equivalent then these states are equivalent.
For a finite-state automaton, there are two equivalent states for every integer .
Let be a finite-state automaton that has a set of states . Suppose and are two states of
If is equivalent to , then the eventual function for an input string that the length is less than or equal where .
If is a non accepting state, then is also a non accepting state.
is an accepting state, then is an accepting state
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started