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
Categorizing Automata by W-Machine Programs
Full text PdfPdf (753 KB)
Source Journal of the ACM (JACM) archive
Volume 8 ,  Issue 3  (July 1961) table of contents
Pages: 384 - 399  
Year of Publication: 1961
ISSN:0004-5411
Author
C. Y. Lee  Bell Telephone Laboratories, Whippany, New Jersey
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 18,   Citation Count: 5
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/321075.321082
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
Hao Wang, A Variant to Turing's Theory of Computing Machines, Journal of the ACM (JACM), v.4 n.1, p.63-92, Jan. 1957  [doi>10.1145/320856.320867]
 
2
TURING, A.M. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 24 (1936), 230-265.
 
3
L~E, C.Y. Automata and finite automata. BSTJ 39, No. 5 (1960), 1267-1295.
 
4
MOORE, E F. Gedanken experiments on sequential machines. Automata Studies, Annals of Math. Studies No. 34, pp. 129-153 (1956).
 
5
HUFFMAN, }). A. Synthesis of sequential switching circuits. J. Franklin Inst. 257 (1957), 161-190, 275-300.
 
6
PAVLL, M. C. and UNGER, S.H. Minimizing the number of states in incompletely specified sequential switching functions. IRE Transactions, EC-8 (1959), 356-367.
 
7
KLEENE, S.C. Introduction to Metamathematics. D. Van Nostrand, Princeton, 1952.
8
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]

CITED BY  5
Ralph E. Griswold, A history of the SNOBOL programming languages, ACM SIGPLAN Notices, v.13 n.8, p.275-308, August 1978
J. C. Shepherdson , H. E. Sturgis, Computability of Recursive Functions, Journal of the ACM (JACM), v.10 n.2, p.217-255, April 1963
Patrick C. Fischer, Multi-tape and infinite-state automata—a survey, Communications of the ACM, v.8 n.12, p.799-805, Dec. 1965
M. W. Curtis, A Turing Machine Simulator, Journal of the ACM (JACM), v.12 n.1, p.1-13, Jan. 1965
Ralph E. Griswold, A history of the SNOBOL programming languages, History of programming languages I, ACM Press, New York, NY, 1978

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Bounded-action devices (e.g., Turing machines, random access machines)

Additional 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:
Algorithms, Measurement, Performance, Theory, Verification

Collaborative Colleagues:
C. Y. Lee: 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