Finite Automata, Pattern Recognition and Perceptrons

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Finite Automata, Pattern Recognition and Perceptrons

Full text

Pdf (1.08 MB)

Source

Journal of the ACM (JACM) archive
Volume 8 , Issue 1 (January 1961) table of contents

Pages: 1 - 20

Year of Publication: 1961

ISSN:0004-5411

Author

Herbert B. Keller

Institute of Mathematical Sciences, New York University, New York, N. Y.

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 24, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

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/321052.321053 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	McCLLOCH, W. S., ND PZT'S, W., A logical calculus of he ides imminelt il nerveus activity. BulL Math. Biophys. 5 (1943), 115-133.
	2	KELENS. C., Represenation of events in nerve nets md finite tulonat. Atonata Studies, Princeton University Press (1956), pp. 3-41.
	3	Vex NETVe,ANN, J., Probbilistie logics and the synthesis of reliable organisms from unreliable components. Autoata Sttdies, Princeton University Press (1956), pp. 43-98.
	4	ROSSXLATT, F., (a) The perceptron; theory of statisticd separtbility in cogitive systems. Cornell Aero. Lab., Inc., Report No. VG-1196-G-1 (1958). (b) Two theorems of statistical separability in the pereeptron. Cornell Aero. Lab., Inc., Report No. VG-1196-G-2 (1958).
	5	CVLBERTSON, J. T., Some uneconomical robots. Automata Studies, Princeton University Press (1956), pp 99-116.

CITED BY 2

	R. J. Nelson, Invited papers—1: basic concepts of automata theory, Proceedings of the 1965 20th national conference, p.138-161, August 24-26, 1965, Cleveland, Ohio, United States
	Shawn Mikula , Ernst Niebur, Exact solutions for rate and synchrony in recurrent networks of coincidence detectors, Neural Computation, v.20 n.11, p.2637-2661, November 2008