论文信息 - The Simplification of Sequential Machines with Input Restrictions

The Simplification of Sequential Machines with Input Restrictions

A procedure is presented for simplifying the flow table of a sequential machine M when, in addition to the given flow table, it is specified that certain input sequences cannot occur. It is assumed that M receives its input from the output of another machine M, and that the restricted sequences are therefore those sequences that M, cannot generate.

Monty Newborn | Joonki Kim

[1] FRED W. SMITH,et al. Pattern Classifier Design by Linear Programming , 1968, IEEE Transactions on Computers.

[2] Frederick C. Hennie,et al. Finite-state Models for Logical Machines , 1968 .

[3] King-Sun Fu,et al. Sequential recognition using a nonparametric ranking procedure , 1967, IEEE Trans. Inf. Theory.

[4] David A. Huffman,et al. The synthesis of sequential switching circuits , 1954 .

[5] Edward J. McCluskey. Minimum-state sequential circuits for a restricted class of incompletely specified flow tables , 1962 .

[6] M. L. Moe,et al. Sequential Algorithm for the Design of Piecewise Linear Classifiers , 1969, IEEE Trans. Syst. Sci. Cybern..

[7] Stephen H. Unger,et al. Minimizing the Number of States in Incompletely Specified Sequential Switching Functions , 1959, IRE Trans. Electron. Comput..

[8] Fabrizio Luccio,et al. A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks , 1965, IEEE Trans. Electron. Comput..

[9] Seymour Ginsburg. A Technique for the Reduction of a Given Machine to a Minimal-State Machine , 1959, IRE Trans. Electron. Comput..

[10] Stephen H. Unger. Flow Table Simplification-Some Useful Aids , 1965, IEEE Trans. Electron. Comput..

[11] Theodore M. Booth. Demonstrating hazards in sequential relay circuits , 1963, SWCT.

[12] Stephen H. Unger,et al. Asynchronous sequential switching circuits , 1969 .