### Abstract

This paper proposes a heuristic algorithm for state minimization of incompletely specified finite state machines (FSMs). The strategy is similar to that in ESPRESSO, a well-known heuristic algorithm for two-level logic minimization. It consists of generating an initial solution, the set of maximal compatibles, and attempting to apply a series of transformations to the solution. The main transformation is to reduce each compatible in the solution and delete unnecessary compatibles by iterative improvements. Other transformations, such as expansion and merging of compatibles, are also introduced for further reduction. When the number of compatibles is likely to be too large to handle explicitly, they are represented by a Binary Decision Diagram. Experimental results show that the proposed method finds better solutions in shorter CPU times for most of the examples than conventional methods.

Original language | English |
---|---|

Pages (from-to) | 993-1000 |

Number of pages | 8 |

Journal | IEICE Transactions on Information and Systems |

Volume | E80-D |

Issue number | 10 |

Publication status | Published - Jan 1 1997 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence

### Cite this

*IEICE Transactions on Information and Systems*,

*E80-D*(10), 993-1000.

**An iterative improvement method for state minimization of incompletely specified finite state machines.** / Higuchi, Hiroyuki; Matsunaga, Yusuke.

Research output: Contribution to journal › Article

*IEICE Transactions on Information and Systems*, vol. E80-D, no. 10, pp. 993-1000.

}

TY - JOUR

T1 - An iterative improvement method for state minimization of incompletely specified finite state machines

AU - Higuchi, Hiroyuki

AU - Matsunaga, Yusuke

PY - 1997/1/1

Y1 - 1997/1/1

N2 - This paper proposes a heuristic algorithm for state minimization of incompletely specified finite state machines (FSMs). The strategy is similar to that in ESPRESSO, a well-known heuristic algorithm for two-level logic minimization. It consists of generating an initial solution, the set of maximal compatibles, and attempting to apply a series of transformations to the solution. The main transformation is to reduce each compatible in the solution and delete unnecessary compatibles by iterative improvements. Other transformations, such as expansion and merging of compatibles, are also introduced for further reduction. When the number of compatibles is likely to be too large to handle explicitly, they are represented by a Binary Decision Diagram. Experimental results show that the proposed method finds better solutions in shorter CPU times for most of the examples than conventional methods.

AB - This paper proposes a heuristic algorithm for state minimization of incompletely specified finite state machines (FSMs). The strategy is similar to that in ESPRESSO, a well-known heuristic algorithm for two-level logic minimization. It consists of generating an initial solution, the set of maximal compatibles, and attempting to apply a series of transformations to the solution. The main transformation is to reduce each compatible in the solution and delete unnecessary compatibles by iterative improvements. Other transformations, such as expansion and merging of compatibles, are also introduced for further reduction. When the number of compatibles is likely to be too large to handle explicitly, they are represented by a Binary Decision Diagram. Experimental results show that the proposed method finds better solutions in shorter CPU times for most of the examples than conventional methods.

UR - http://www.scopus.com/inward/record.url?scp=0031247637&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031247637&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031247637

VL - E80-D

SP - 993

EP - 1000

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 10

ER -