The Simplification of Sequential Machines with Input Restrictions

IEEE Transactions on Computers

Volumn C-21, Issue 12, 1972, Pages 1440-1443

  Kim, Joonki ^a   Newborn, Monroe M ^a  

^a Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Composite machines; flow table simplification; input restricted flow table; sequential machines

Indexed keywords

AUTOMATA THEORY;

EID: 0015490732     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1972.223521     Document Type: Article

References (8)

1. D. A. Huffman, “The synthesis of sequential switching circuits,” J. Franklin Inst., vol. 257, pp. 161–190, 275–303, Mar./Apr. 1954.
2. S. Ginsburg, “A technique for the reduction of a given machine to a minimal state machine,” IRE Trans. Electron. Comput., vol. EC-8, pp. 346–355, Sept. 1959.
3. M. C. Paull and S. H. Unger, “Minimizing the number of states in incompletely specified sequential switching functions,” IRE Trans. Electron. Comput., vol. EC-8, pp. 356–367, Sept. 1959.
4. A. Grasselli and F. Luccio, “A method for minimizing the number of internal states in incompletely specified sequential networks,” IEEE Trans. Electron. Comput., vol. EC-14, pp. 350–359, June 1965.
5. E. J. McCluskey, “Minimum-state sequential circuits for a restricted class of incompletely specified flow tables,” Bell Syst. Tech. J., vol. 40, pp. 1759–1768, Nov. 1962.
6. S. H. Unger, “Flow table simplification-Some useful aids,” IEEE Trans. Electron. Comput., vol. EC-14, pp. 472–475, June 1965.
7. S. H. Unger, Asynchronous Sequential Switching Circuits. New York: Wiley, 1969.
8. F. C. Hennie, Finite State Models for Logical Machines. New York: Wiley, 1968.