论文信息 - Minimal Sequential Machines

Minimal Sequential Machines

The general class of sequential machines defined by Mealy is investigated. It is found that any such machine can be identified with a set of machines of equivalent minimality. A procedure for developing the aggregate of all sets of gates for such minimal machines is evolved, and the problem of selecting components for constructing machines is discussed.

Douglas B. Netherwood

[1] David A. Huffman. The Design and Use of Hazard-Free Switching Networks , 1957, JACM.

[2] Douglas B. Netherwood. Logic Matrices and the Truth Function Problem , 1959, JACM.

[3] Midhat J. Ghazala. Irredundant Disjunctive and Conjunctive Forms of a Boolean Function , 1957, IBM J. Res. Dev..

[4] Richard F. Rutz. Two-Collector Transistor for Binary Full Addition , 1957, IBM J. Res. Dev..

[5] Bradford Dunham,et al. The Multipurpose Bias Device - Part I: The Commutator Transistor , 1957, IBM J. Res. Dev..

[6] Hewitt D. Crane,et al. A High-Speed Logic System Using Magnetic Elements and Connecting Wire Only , 1959, Proceedings of the IRE.

[7] J. Suran,et al. Multihole Ferrite Core Configurations and Applications , 1957, Proceedings of the IRE.

[8] Calvin C. Elgot,et al. Realization of Events by Logical Nets , 1958, JACM.

[9] D. D. Aufenkamp,et al. Analysis of Sequential Machines II , 1957, IRE Trans. Electron. Comput..

[10] T. H. Crowley,et al. The Laddic — A magnetic device for performing logic , 1959 .

[11] D. Slepian. On The Number of Symmetry Types of Boolean Functions of n Variables , 1953, Canadian Journal of Mathematics.

[12] George H. Mealy,et al. A method for synthesizing sequential circuits , 1955 .

[13] E. McCluskey. Minimization of Boolean functions , 1956 .