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
Solvability of Machine Mappings of Regular Sets to Regular Sets
Full text PdfPdf (779 KB)
Source Journal of the ACM (JACM) archive
Volume 11 ,  Issue 3  (July 1964) table of contents
Pages: 302 - 312  
Year of Publication: 1964
ISSN:0004-5411
Authors
Seymour Ginsburg  System Development Corporation, Santa Monica, California
Thomas N. Hibbard  System Development Corporation, Santa Monica, California
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 15,   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/321229.321234
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
Seymour Ginsburg , H. Gordon Rice, Two Families of Languages Related to ALGOL, Journal of the ACM (JACM), v.9 n.3, p.350-371, July 1962  [doi>10.1145/321127.321132]
2
Seymour Ginsburg , G. F. Rose, Operations Which Preserve Definability in Languages, Journal of the ACM (JACM), v.10 n.2, p.175-195, April 1963  [doi>10.1145/321160.321167]
3
Seymour Ginsburg , Gene F. Rose, Some Recursively Unsolvable Problems in ALGOL-Like Languages, Journal of the ACM (JACM), v.10 n.1, p.29-47, Jan. 1963  [doi>10.1145/321150.321153]
 
4
KoNIG, D. Theorie Der Endlichen und Unencltichen Graphen. CheIsea Publishing Co, New York, 1950.
 
5
RABINs, M., AND SCOTT, D. Finite automata and their decision problems. IBM Y. research Devsl. 3 (1959), 115-125.
 
6
YNGVE, V. A model and tm hypothesis for language structure. Proc. Am. Philos. Soc. lO4 (1960), 444-466.
 
7
---- Comupter programs for translation. Sci, Am. 206' (June 1962), 68-76.

CITED BY  2
Robert McNaughton, A decision procedure for generalized sequential mapability-onto of regular sets, Proceedings of the third annual ACM symposium on Theory of computing, p.206-218, May 03-05, 1971, Shaker Heights, Ohio, United States
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:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

Additional Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic
          Subjects: Set theory


General Terms:
Performance, Theory, Verification

Collaborative Colleagues:
Seymour Ginsburg: 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