Parsing a graph-grammar

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parsing a graph-grammar

Full text

Pdf (427 KB)

Source

ACM Annual Computer Science Conference archive
Proceedings of the 1988 ACM sixteenth annual conference on Computer science table of contents

Atlanta, Georgia, United States

Pages: 249 - 255

Year of Publication: 1988

ISBN:0-89791-260-8

Author

Carolyn McCreary

The American University, Washington, D.C.

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 34, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/322609.322649 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.

	AGU 72	A. V. Aho, M. R. Garey, and J. D. Ullman, Transf.ttue t~eduotion of a Directed Graph, SIAM O. Comput., vol.1, no. 2, June 1972, pp 131-137.
	AHU 74	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	CLR 79	V. Claus, H. Ehrig, and G. Rosenber9, ed. Graph-Grammars and Their Appl teat ton to Computer Science and BtoloEy, Lecture Notes in Computer Sci ence 73, SpPinger-Verlag, N.Y. , N.Y., 1979.
	ENR 83	Hartmut Ehrig , M. Nagl , Grzegorz Rozenberg , Azriel Rosenfeld, Graph-Grammars and Their Application to Computer Science, Springer-Verlag New York, Inc., Secaucus, NJ, 1988
	ER1 86	A. Ehrenfeucht and G. Roaenberg, Finite FamiLies of Finite Sets, Part I: Independent Boolean Algebras and Thetr Bodies, Department of Computer Soiante, University of Colorado at Boulder, Technical Report No. CU-CS-32B-86, Boulder, 1986.
	ER2 86	A. Ehrenfeucht and G. Rosenberg, Finite Families of Finite Sets, Part II: Semi-independent Boolean A lgebras and Their semibodies, Department of Computer Science, University of Colorado at Boulder, Technical Report No. CU-CS-326-86, Boul den, 1986.
	ER3 86	A. Ehrenfeucht and G. Rosenberg, A Decompostton Theorem for 2-Structures, Department of Computer Science, University of Colorado at Bou I dec, TechnicaI Report No. CU-CS-328-86, Boulder, 1986.
	H 69	F. Herary, Graph Theory, Addison-Wesley, Reading, Haas., 1959
	HS 84	Ellis Horowitz , Sartaj Sahni, Fundamentals of Computer Alori, W. H. Freeman & Co., New York, NY, 1978
	M 87	C. L. McCreary, An algorithm for parsing a graph grammar, University of Colorado at Boulder, Boulder, CO, 1987
	MT 69	Dennis M. Moyles , Gerald L. Thompson, An Algorithm for Finding a Minimum Equivalent Graph of a Digraph, Journal of the ACM (JACM), v.16 n.3, p.455-460, July 1969 [doi>10.1145/321526.321534]
	P 78	V. Pan, Proc. 1Sth Annual Symposium on the Foundations of Computer So lance, 1978.
	RW 86	Grzegorz Rozenberg , Emo Welzl, Boundary NLC graph grammars--basic definitions, normal forms, and complexity, Information and Control, v.69 n.1-3, p.136-167, April/May/June 1986 [doi>10.1016/S0019-9958(86)80045-6]

CITED BY 2

	J. Najarian, On the complexity of parsing in graph grammars, Proceedings of the 17th conference on ACM Annual Computer Science Conference, p.301-304, February 21-23, 1989, Louisville, Kentucky
	C. L. McCreary , D. H. Gill, Automatic partitioning and virtual scheduling for efficient parallel execution, Proceedings of the 30th annual Southeast regional conference, April 08-10, 1992, Raleigh, North Carolina