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
Finite Automata, Pattern Recognition and Perceptrons
Full text PdfPdf (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): 4,   Downloads (12 Months): 31,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

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/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
 
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
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

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:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
  I.5 PATTERN RECOGNITION


General Terms:
Performance, Theory, Verification

Collaborative Colleagues:
Herbert B. Keller: colleagues

Peer to Peer - Readers of this Article have also read:

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