Two Problems on Boolean Memories
Henrik Eriksson, P.-E. Danielsson · IEEE Transactions on Electronic Computers · 1967
This paper is intended to improve Huffman's results on universal encoding of asynchronous sequential networks. The method employed here consists of assigning to each row of the flow table a single vertex on the corresponding hypercube. The remaining vertices are used for the transitions between stable states. Such a vertex can be used for different transitions if they correspond to distinct input states.