The L‐map method for sequential machine state minimization

Abstract

The L‐map method is an innovative method for sequential machine state minimization. More specifically, the L‐map method consists of five steps. This method uses a portion of the partitioning method (step 1), and a portion of the implication table method (step 4). Steps 2 (eliminate singleton blocks), 3 (order non‐singleton blocks) and 5 (process the block implication table cells) are developed in this paper. The resultant method is more effective than both the partitioning method and the implication table method. The L‐map method is best illustrated by examples. In addition, 11 theorems are proven with illustrative examples. The advantages of this method over the partitioning method and the implication table method are stated. Furthermore, an algorithm which has four steps for finding the shortest input sequences for separating all pairs of distinguishable states using the L‐map method is developed. Illustrative examples are given to demonstrate this algorithm. The results obtained in this may have useful applications in logic design, computer design, as well as VLSI design.

Citation

Lee, E.T. (1998), "The L‐map method for sequential machine state minimization", Kybernetes, Vol. 27 No. 9, pp. 1036-1052. https://doi.org/10.1108/03684929810246053