Write a complete proof of property (12.3.7).
That any equivalent class cannot have both accepting and nonaccepting states.
If two states of a particular finite-state automaton are equivalent, we can observe that applying a string of inputs to these two states brings the automaton to an accepting state or nonaccepting state.
Here we obtain two equivalent classes only
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started