|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines
July 1979 (vol. 28 no. 7)
pp. 531-535
| ASCII Text | x | ||
| A. Dunworth, H.V. Hartog, "An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines," IEEE Transactions on Computers, vol. 28, no. 7, pp. 531-535, July, 1979. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1979.1675400, author = {A. Dunworth and H.V. Hartog}, title = {An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines}, journal ={IEEE Transactions on Computers}, volume = {28}, number = {7}, issn = {0018-9340}, year = {1979}, pages = {531-535}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1979.1675400}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines IS - 7 SN - 0018-9340 SP531 EP535 EPD - 531-535 A1 - A. Dunworth, A1 - H.V. Hartog, PY - 1979 KW - pairs-table analysis KW - Class-C KW - class-C1 machines KW - compatible and image-compatible classes KW - equivalence and image-equivalence classes KW - incompletely specified sequential machines KW - maximal compatibles KW - minimal covering machines VL - 28 JA - IEEE Transactions on Computers ER - | |||
Two classes of incompletely specified sequential machine (ISSM) are described, which contain the class of input-restricted machines defined by McCluskey [1] and Unger [2] as special cases. These new classes of machine can be identified at the conclusion of a modified (and more efficient) version of the standard compatible pairs-table analysis of Paull and Unger [3]. For such machines only maximal compatible classes need be considered in finding the minimal state machine, and any such covering selection is also closed. An algorithm is presented which is fast and efficient both for hand-use and computer implementation.
Index Terms:
pairs-table analysis, Class-C, class-C1 machines, compatible and image-compatible classes, equivalence and image-equivalence classes, incompletely specified sequential machines, maximal compatibles, minimal covering machines
Citation:
A. Dunworth, H.V. Hartog, "An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines," IEEE Transactions on Computers, vol. 28, no. 7, pp. 531-535, July 1979, doi:10.1109/TC.1979.1675400
Usage of this product signifies your acceptance of the Terms of Use.