On Coding the States of Sequential Machines with the Use of Partition Pairs

This article introduces a new technique of making state assignment for sequential machines. The technique is in line with the approach used by Hartmanis [l], Stearns and Hartmanis [3], and Curtis [4]. It parallels the work of Dolotta and McCluskey [7], although it was developed independently. The paper describes a procedure for making assignments based on partition pairs with successive choice of the partition.