On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine

Full text

Pdf (716 KB)

Source

Journal of the ACM (JACM) archive
Volume 5 , Issue 3 (July 1958) table of contents

Pages: 266 - 280

Year of Publication: 1958

ISSN:0004-5411

Author

Seymour Ginsburg

The National Cash Register Company, Hawthorne, California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 14, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/320932.320938 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	WILLIAM CADnEN, Sequential Circuit Theory. Ph.D. Thesis, Princeton, 1956.
	2	GEORGe. MEALY, A Method for Synthesizing Sequential Circuits. The Bell Tech. J., Sept. 1955, pp. 1045-1079.
	3	EDWARD MooRE, Gedanben--Experimen~s on Sequential Machines. Annals of Mathematics Studies, No. 34, Automata Studies, pp. 129-153.

CITED BY 5

	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
	Arto Salomaa, Composition sequences for functions over a finite domain, Theoretical Computer Science, v.292 n.1, p.263-281, January 2003
	Elena Calude , Bruce Mills , Lan Mills, A uniform approach to test computational complementarity, Acta Cybernetica, v.16 n.3, p.367-384, August 2004
	Walter R. Stahl , Robert W. Coffin , Harry E. Goheen, Simulation of biological cells by systems composed of string-processing finite automata, Proceedings of the April 21-23, 1964, spring joint computer conference, April 21-23, 1964, Washington, D.C.
	David Eppstein , Jean-Claude Falmagne, Algorithms for media, Discrete Applied Mathematics, v.156 n.8, p.1308-1320, April, 2008