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
A Generalization of Ogden's Lemma
Full text PdfPdf (211 KB)
Source Journal of the ACM (JACM) archive
Volume 29 ,  Issue 2  (April 1982) table of contents
Pages: 404 - 407  
Year of Publication: 1982
ISSN:0004-5411
Authors
Christopher Bader  7421 Saville Court, Alexandria, VA
Arnaldo Moura  Department of Computer Science, University of California, Berkeley, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 85,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322307.322315
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
Alfred V. Aho , Jeffrey D. Ullman, The Theory of Parsing, Translation, and Compiling, Prentice Hall Professional Technical Reference, 1972
 
2
OGDEN, W. A helpful result for proving inherent ambiguity. Math. Syst Theory 2 (1968), t91-194.
 
3
Arto Salomaa, Formal languages, Academic Press Professional, Inc., San Diego, CA, 1987
 
4
WISE, D.S. A strong pumping lemma for context-free languages. Theor. Comput. Sct 3 (1976), 359-369.

INDEX TERMS

Primary 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)

Additional Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.2 Grammars and Other Rewriting Systems
          Subjects: Grammar types (e.g., context-free, context-sensitive)


General Terms:
Languages, Performance, Theory, Verification

Collaborative Colleagues:
Christopher Bader: colleagues
Arnaldo Moura: colleagues

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

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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player