Prove that if two states of a finite-state automaton are k-equivalent for some integer
Chapter 12, Problem 17(choose chapter or problem)
Prove that if two states of a finite-state automaton are k-equivalent for some integer k, then those states are m-equivalent for all nonnegative integers m < k.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer