ACM Home Page
Please provide us with feedback. Feedback
Use of Decomposition Theory in the Solution of the State Assignment Problem of Sequential Machines
Full text PdfPdf (1.49 MB)
Source Journal of the ACM (JACM) archive
Volume 10 ,  Issue 3  (July 1963) table of contents
Pages: 386 - 411  
Year of Publication: 1963
ISSN:0004-5411
Author
H. Allen Curtis  Lewis Research Center, N.A.S.A., Cleveland, Ohio
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 15,   Citation Count: 0
Additional Information:

references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321172.321184
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
HartMAN J. Symbolic analtysis of a decomposition of information processing maw chines. Inform. and Contr. 8 (Jun.e 1960), 154-178.
 
2
----. 0n the sate assignment problem for sequential machines t. IRE Trans. EC-IO (June 1961, 157-165.
 
3
STraRss, R. E,.and HarTmans, J. On the state assignment problem for sequential machiLLes II. lRE Trars. EC-IO (Dee. 1961), 593-603.
 
4
HatrTANIS J. Loop-free structure of sequential machines. Information and Control
 
5
----.. Maximal autonomous clocks of sequential machines. IRE Trans. EC-11 (Feb. 1962).
6
 
7
ASHE-tVnS R. L. The decomposition of switctling unctions. Proc. Internat. Symposium on the Theory f Switching (1959).
 
8
CURTIS, H.A. A New Approach to the Design of Switching Circuits, 466-500. D. Van Nostrand Co., Inc., Princeton (1962).
9
10