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
Two-way balloon automata and AFL
Full text PdfPdf (680 KB)
Source Journal of the ACM (JACM) archive
Volume 17 ,  Issue 1  (January 1970) table of contents
Pages: 3 - 13  
Year of Publication: 1970
ISSN:0004-5411
Authors
Seymour Ginsburg  University of Southern California, Los Angeles, California and System Development Corporation, Santa Monica, California
John Hopcroft  Cornell University, Ithaca, New York and System Development Corporation, Santa Monica, California
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 30,   Citation Count: 1
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/321556.321558
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
GINSBURG, S., AND GREIBACH, S. Abstract families of languages. In Studies in Abstract Families of Languages, Amer. Math. Soc. Memoir 87, 1969, pp. 1-32.
2
Seymour Ginsburg , Sheila A. Greibach , Michael A. Harrison, Stack automata and compiling, Journal of the ACM (JACM), v.14 n.1, p.172-201, Jan. 1967  [doi>10.1145/321371.321385]
 
3
HOPCROFT, J., AND ULLMAN, J. An approach to a unified theory of automata. Bell Syst. Tech. J. 46 (1967), 1793-1829.
4
J. D. Ullman, Halting Stack Automata, Journal of the ACM (JACM), v.16 n.4, p.550-563, Oct. 1969  [doi>10.1145/321541.321544]

CITED BY
Thomas Buchholz , Andreas Klein , Martin Kutrib, On interacting automata with limited nondeterminism, Fundamenta Informaticae, v.52 n.1-3, p.15-38, September 2002

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES

Additional Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.3 Formal Languages
          Subjects: Classes defined by grammars or automata (e.g., context-free languages, regular sets, recursive sets)


General Terms:
Languages, Performance, Theory, Verification

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