Linear and Context-Free Graph Grammars

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Linear and Context-Free Graph Grammars

Full text

Pdf (650 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 1 (January 1972) table of contents

Pages: 11 - 22

Year of Publication: 1972

ISSN:0004-5411

Author

T. Pavlidis

Princeton University, Department of Electrical Engineering, Princeton, New Jersey

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 64, Citation Count: 1

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/321679.321682 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	MILLER, W. F., AND SHAW, A. C. Linguistic methods in picture processing--a survey. Proc. FJCC, Vol. ~ (1968), pp. 279-290.
	2	PFALTZ, J. L., AND ROSENFELD, A. Web grammars. Proc. Joint Intern. Conf. on Artificial Intelligence, Washington, D. C., May 1969.
	3	Alan C. Shaw, Parsing of Graph-Representable Pictures, Journal of the ACM (JACM), v.17 n.3, p.453-481, July 1970 [doi>10.1145/321592.321598]
	4	MONTANARI, U.G. Separable graphs, planar graphs and web grammars. Inform. Cont. 16 (May 1970), 243-267.
	5	PFALTZ, J. L. Web grammars and picture description. Tech. Rep. 79-138, Comp. Sci. Center, U. of Maryland, Sept. 1970.
	6	Fu, KING-SuN, AND SWAIN, P .H . OR syntactic pattern recognition. In Software Engineering, Vol. 2 (J. Tou, Ed.), Academic Press, New York, 1971, pp. 155-182.
	7	ROSENFELD, A., AND STRONG, J .P . A grammar for maps. In Software Engineering, Vol. 2 (J. Tou, Ed.), Academic Press, New York, 1971, pp. 227-239.
	8	SHAW, A.C. Picture graphs, grammars and parsing. Tech. Rep. No. 71-89, Dep. of Comp. Sci., Cornell U., Jan. 1971 (presented at the International Conference on Frontiers of Pattern Recognition, Honolulu, Hawaii, Jan. 1971).
	9	PAVLIDIS, T. Structural pattern recognition: Primitives and juxtaposition relations. Tech. Report No. 89, Comp. Sci. Lab., Princeton U., Jan. 1971 (presented at the International Conference on Frontiers of Pattern Recognition, Honolulu, Hawaii, Jan. 1971).
	10	FEDEa, J. Plex languages. Inform. Set. 8 (1971), 225-241.
	11	ROSENFELD, A. Isotonic grammars, parallel grammars and picture grammars. In Machine Intelligence, Vol. 6, 1971. Edinburgh U. Press, Edinburgh, 1971, pp. 281-294.
	12	William C. Rounds, Context-free grammars on trees, Proceedings of the first annual ACM symposium on Theory of computing, p.143-148, May 05-07, 1969, Marina del Rey, California, United States [doi>10.1145/800169.805428]
	13	THATCHER, J. W. There's a lot more to finite automata theory than you would have thought. Proc. ~th Annual Princeton Conference, March 1970, pp. 263-276.
	14	HARARY, F. Graph Theory. Addison-Wesley, Reading, Mass., 1969.
	15	John E. Hopcroft , Jeffrey D. Ullman, Formal languages and their relation to automata, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1969
	16	BLUM, M., AND HEWITT, C. Automata on a two-dimensional tape. Proc. 8th IEEE Conference on Switching and Automata Theory, 1968, pp. 155-160.
	17	MINSKY, M., AND PAPERT, S. Perceptrons. M.I.T. Press, Cambridge, Mass., 1969.
	18	MYLOPOULOS, J. On the definition and recognition of patterns in discrete spaces. Tech. Rep. No. 84, Comp. Sci. Lab., Princeton U., Aug. 1970.
	19	MILGRAM, D. L., AND ROSENFELD, A. Array automata and array grammars. Tech. Rep. No. 70-141, Comp. Set. Center, U. of Maryland, Nov. 1970.