ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
On the Reduction of Superfluous States in a Sequential Machine
Full text PdfPdf (1.09 MB)
Source Journal of the ACM (JACM) archive
Volume 6 ,  Issue 2  (April 1959) table of contents
Pages: 259 - 282  
Year of Publication: 1959
ISSN:0004-5411
Author
Seymour Ginsburg  The National Cash Register Company, Hawthorne, California
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 16,   Citation Count: 4
Additional Information:

references   cited by   index terms   collaborative colleagues  

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/320964.320983
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
D. D. AIIFlgNKAMP AND F. E. Hoax, Oriented Graphs and Sequential Machines, Bell Labor~tory Report, August 1954.
 
2
S. G1~ssur~G, A Synthesis Technique for Minimal State Sequential Machines, to appear in the IRE Trans~ctmns on Electronic Computers.
 
3
D. A. ~:{UFFMAN, The Synthesis of Sequentinl Switching Circuits, or. Franklin ~nst. 257, 161--190, 275-303, 1954.
 
4
G. H. MEALY, A Method for Synthesizing Sequential Circuits, Bell Sys. Tech. J. 84, 1045-79, 1955.
 
5
E. F. MOORE, Gedanken-Experiments on Sequential Machines, in Automata Studies, pp. 129-53, Princeton University Press, 1956.

CITED BY  4
C. Y. Lee, Categorizing Automata by W-Machine Programs, Journal of the ACM (JACM), v.8 n.3, p.384-399, July 1961
Seymour Ginsburg, Connective Properties Preserved in Minimal State Machines, Journal of the ACM (JACM), v.7 n.4, p.311-325, Oct. 1960
Thomas N. Hibbard, Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines, Journal of the ACM (JACM), v.8 n.4, p.601-612, Oct. 1961
Seymour Ginsburg, Compatibility of States in Input-Independent Machines, Journal of the ACM (JACM), v.8 n.3, p.400-403, July 1961

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Automata (e.g., finite, push-down, resource-bounded)


General Terms:
Measurement, Performance, Theory, Verification

Collaborative Colleagues:
Seymour Ginsburg: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player