Abstract: Existing techniques for finding minimum state covers of an incompletely specified sequential machine are streamlined to yield a single minimum ...

A simple yet efficient method for the minimization of incompletely specified sequential machines (ISSM's) and it is shown that ordering the compatibles, ...

Feb 1, 1973 · Existing techniques for finding minimum state covers of an incompletely specified sequential machine are streamlined to yield a single ...

"Exact and Heuristic Algorithms for the Minimization of Incompletely Specified State Machines". IEEE Trans. on Computer-Aided Design, vol.13, pp.67-177, Feb.

This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements.

Minimization of incompletely specified finite state machines (FSMs) is an important task in the optimal design of sequential circuits, since it enhances ...

A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks · An Efficient State Minimization Algorithm for Some Special ...

Two classes of incompletely specified sequential machine (ISSM) are described, which contain the class of input-restricted machines defined by McCluskey [1] ...

Jan 24, 2017 · Abstract. This paper presents a heuristic method for minimization of incom- pletely specified finite state machine with unspecified values ...

This paper describes a new method for the state minimization of incompletely specified sequential machines. Previously described methods start with ...