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
On the complexity of parsing in graph grammars
Full text PdfPdf (114 KB)
Source ACM Annual Computer Science Conference archive
Proceedings of the 17th conference on ACM Annual Computer Science Conference table of contents
Louisville, Kentucky
Pages: 301 - 304  
Year of Publication: 1989
ISBN:0-89791-299-3
Author
J. Najarian  Department of Computer Science, William Paterson College of New Jersey
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 10,   Citation Count: 0
Additional Information:

references   index terms   peer to peer  

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/75427.75465
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
Claus, V., ghrig, 8., and Rozenberg, G. (eds.) Graph-Grammars and Their Application to Computer Science #1. Lecture Notes in Computer Science 73, Springer-Verlag, Berlin, 1979.
 
2
Ehrig, H., Nagl, M., and Rozenberg, G. (eds.) Graph-Grammars and Their Application to Computer Science #2. Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987.
 
3
Hartmut Ehrig , M. Nagl , Grzegorz Rozenberg , Azriel Rosenfeld, Graph-Grammars and Their Application to Computer Science, Springer-Verlag New York, Inc., Secaucus, NJ, 1988
 
4
Karp, R. M. "Reducibility among combinatorial problems", in Miller, R.E., and Thatcher, J.W. (eds.) Complexity of Computer Computation, Plenum Press, New York, 1972.
5
Carolyn McCreary, Parsing a graph-grammar, Proceedings of the 1988 ACM sixteenth annual conference on Computer science, p.249-255, February 1988, Atlanta, Georgia, United States  [doi>10.1145/322609.322649]
 
6
Yeh, R. T. (ed.) Applied Computation Theory. Prentice-Hall, New Jersey, 1976.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.3 Complexity Measures and Classes
          Subjects: Reducibility and completeness
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.2 Grammars and Other Rewriting Systems
          Subjects: Parsing


General Terms:
Algorithms, Languages, Theory


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

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