1. Prove that the method for the construction of k-equivalence partitions described in Example 5.8 will always converge, i.e. there will be a table Pn, n > 0, such that Pn = Pn+1. 2. Prove that the...

1. Prove that the method for the construction of k-equivalence partitions described in Example 5.8 will always converge, i.e. there will be a table Pn, n > 0, such that Pn = Pn+1.

2. Prove that the k-equivalence partition of a machine is unique.

May 26, 2022