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
Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines
Full text PdfPdf (554 KB)
Source Journal of the ACM (JACM) archive
Volume 8 ,  Issue 4  (October 1961) table of contents
Pages: 601 - 612  
Year of Publication: 1961
ISSN:0004-5411
Author
Thomas N. Hibbard  System Development Corporation, Santa Monica, California
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Citation Count: 2
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/321088.321098
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
MOORE, :EDWARD Gedanken--experiments on sequential machines Annals of Maihemalics Studies No. 34 (Automata Studies), pp. 129-153, Princeton University Press, 1956
2
Seymour Ginsburg, On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine, Journal of the ACM (JACM), v.5 n.3, p.266-280, July 1958  [doi>10.1145/320932.320938]
3
Seymour Ginsburg, On the Reduction of Superfluous States in a Sequential Machine, Journal of the ACM (JACM), v.6 n.2, p.259-282, April 1959  [doi>10.1145/320964.320983]
 
4
ttX~FFMA~, D. A. The synthesis of sequential switching circuits J. Franklin Inst 257 (1954), 161-190 and 275-303.
 
5
ME~Lr, G H. A method for synthesizing sequential circuits. Bell System Technical J. 3~ (1955), 1045-1079.
 
6
KARATS~A, A.A. Solutmn of a problem from ~he theory of finite automata. Uspekh~ Matematiki Naul~ 15 (1960), 157-159. Translation No. K-218 for sale by Morris D Friedman, Inc, P.O. Box 35, West Newton 65, Mass.

CITED BY  2
V. G. Skobelev, Nonlinear automata over a finite ring, Cybernetics and Systems Analysis, v.42 n.6, p.795-806, November 2006
D. E. Farmer, A strategy for detecting faults in sequential machines not possessing distinguishing sequences, Proceedings of the November 17-19, 1970, fall joint computer conference, November 17-19, 1970, Houston, Texas

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)

Additional Classification:
  B. Hardware
  B.6 LOGIC DESIGN
      B.6.1 Design Styles
          Subjects: Sequential circuits


General Terms:
Experimentation, Measurement, Performance, Theory, Verification

Collaborative Colleagues:
Thomas N. Hibbard: 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