Intersection-closed full AFL and the recursively enumerable languages

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Seymour Ginsburg
Jonathan Goldstine
Published in:
· Proceeding
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Pages 121-131
ACM New York, NY, USA ©1971
table of contents doi>10.1145/800157.805044
Intersection-closed full AFL and the recursively enumerable languages Published by ACM 1971 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 10
· Downloads (cumulative): 357
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder