State Minimization of Incompletely Specified Sequential Machines

Authors:
N. N. Biswas
Affiliations:
Department of Electrical Communication Engineering, Indian Institute of Science
Venue:
IEEE Transactions on Computers
Year:
1974

Citing 2
Cited 5

On the Reduction of Superfluous States in a Sequential Machine

Journal of the ACM (JACM)
State Minimization of Incompletely Specified Sequential Machines

IEEE Transactions on Computers

Worst Case Bounds for Maximal Compatible Subsets

IEEE Transactions on Computers
A Method for Minimizing Incompletely Specified Sequential Machines

IEEE Transactions on Computers
Minimization of Incompletely Specified Sequential Machines

IEEE Transactions on Computers
ISTSM: incompletely specified timed sequential machines (Work-in-Progress)

Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium
An introduction to Timed Sequential Machines

Simulation

Quantified Score

Hi-index	14.99

Visualization

Abstract

A simple procedure for the state minimization of an incompletely specified sequential machine whose number of internal states is not very large is presented. It introduces the concept of a compatibility graph from which the set of maximal compatibles of the machine can be very conveniently derived. Primary and secondary implication trees associated with each maximal compatible are then constructed. The minimal state machine covering the incompletely specified machine is then obtained from these implication trees.