P.K. Gupta , Department of Electrical Engineering, University of Wisconsin

ABSTRACT

Existing techniques for finding minimum state covers of an incompletely specified sequential machine are streamlined to yield a single minimum cover with significantly less computation. The factor by which computation is reduced is directly proportional to the complexity of the machine.