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, Indexed Grammars—An Extension of Context-Free Grammars, Journal of the ACM (JACM), v.15 n.4, p.647-671, Oct. 1968  [doi>10.1145/321479.321488]
	2	Alfred V. Aho, Nested Stack Automata, Journal of the ACM (JACM), v.16 n.3, p.383-406, July 1969  [doi>10.1145/321526.321529]
	3	P. A. Christensen, Hyper-AFL's and ET0L Systems, L Systems, Most of the papers were presented at a conference in Aarhus, Denmark, p.254-257, January 14-25, 1974
	4	DOWNEY, P J Formal languages and recursJon schemes Ph.D Th, Rep TR-16-74, Harvard U, Cambridge, Mass, 1974
	5	Edsger W. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Communications of the ACM, v.18 n.8, p.453-457, Aug. 1975  [doi>10.1145/360933.360975]
	6	DIJKSTRA, E W A Dtsc~phne of Programming PH Series m Automatic Programming, Prentice-Hall, Englewood Chffs, N J, 1976
	7	EHRENFEUCHT, A, AND ROZENBERG, G On some context-free languages that are not determlnisUc ETOL languages. RAIRO (Informatlque Theoretlque) 11 (1977), 273-291.
	8	EHRENFEUCHT, A, ROZENBERG, G, AND SKYUM, S A relationship between ETOL and EDTOL languages Theoret Comptr Scl I (1976), 325-330
	9	EHRICH, R W, AND YAU, S S Two-way sequential transductions and stack automata in/orm and Control 18 (1971), 404--446
	10	ENGELFRIET, J Bottom-up and top-down tree transformatlons--a comparison Math Systems Theory 9 (1975), 198-23 i.
	11	ENGELFRIET. J Surface tree languages and parallel derivation trees Theoret Comptr. Sct 2 (1976), 9-27
	12	Joost Engelfriet, Macro Grammars, Lindenmayer Systems and Other Copying Devices, Proceedings of the Fourth Colloquium on Automata, Languages and Programming, p.221-229, July 18-22, 1977
	13	ENGELFRIET, J, AND MEINECHE SCHMIOT, E IO and OI Part I J Comptr Syst. Sct 15 (1977), 328-353, Part II J Comptr Syst. Sct 16(1978), 67-99
	14	ENGELFRIET, J, AND SKYUM, S Copying theorems Inform. Proc Letters 4 (1976), 157-161
	15	FILi~, G The characterization of some language famdtes by classes of indexed grammars M Sc Th, Dept of Comptr Scl, Pennsylvania State U, Umversity Park, Pa, 1977
	16	FISCHER, M J Grammars with macro-hke productions, Ph D Th, Harvard U, Cambridge, Mass, 1968
	17	Seymour Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages, Elsevier Science Inc., New York, NY, 1975
	18	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]
	19	Seymour Ginsburg , Sheila A. Greibach , Michael A. Harrison, One-way stack automata, Journal of the ACM (JACM), v.14 n.2, p.389-418, April 1967  [doi>10.1145/321386.321403]
	20	GINSBURG, S. GREIBACH, S A, AND HOPCROFT, J E Studtes m Abstract Famdtes of Languages. Memoirs of the AMS 87, Amer Math Society, Providence, R I, 1969
	21	GREIBACH, S Checking automata and one-way stack languages J Comptr Syst Sc~ 3 (1969), 196-217
	22	GREIBACH, S.A One-way fintte VlSlt automata Theoret Comptr Sci 6 (1978), 175-222
	23	GREIBACH, S A Private commumcatmn
	24	Michael A. Harrison , Mario Schkolnick, A Grammatical Characterization of One-Way Nondeterministic Stack Languages, Journal of the ACM (JACM), v.18 n.2, p.148-172, April 1971  [doi>10.1145/321637.321639]
	25	Gabor T. Herman , Grzegorz Rozenberg, Developmental Systems and Languages, Elsevier Science Inc., New York, NY, 1975
	26	John E. Hopcroft , Jeffrey D. Ullman, Formal languages and their relation to automata, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1969
	27	KIEL, D I Two-way a-transducers and AFL J Comptr Syst Sci 10 (1975), 88-109
	28	Zohar Manna, Introduction to Mathematical Theory of Computation, McGraw-Hill, Inc., New York, NY, 1974
	29	Robert McNaughton, Parenthesis Grammars, Journal of the ACM (JACM), v.14 n.3, p.490-500, July 1967  [doi>10.1145/321406.321411]
	30	William F. Ogden, Intercalation theorems for stack languages, Proceedings of the first annual ACM symposium on Theory of computing, p.31-42, May 05-07, 1969, Marina del Rey, California, United States  [doi>10.1145/800169.805419]
	31	PERRAULT, C R Intercalauon lemmas for tree transducer languages J Comptr Syst Sc~ 13 (1976), 246- 277
	32	ROUNDS, W C Mappings and grammars on trees Math Systems Theory 4 (1970), 257-287
	33	ROZENBERG, G Extension of tabled 0L-systems and languages lnt J Comput Inform ScL 2 (1973), 311- 336
	34	ROZENBERG, G, AND VERMEIR, D On ETOL systems of fimte index Rep 75-13, Dept. of Mathematics, U of Antwerp, Wdnjk, Belgmm, 1975
	35	Arto Salomaa, Formal languages, Academic Press Professional, Inc., San Diego, CA, 1987
	36	SKYUM, S Decomposmon theorems for various kinds of languages parallel m nature SlAM d Comput 5 (1976), 284-296
	37	VAN LEEUWEN, J Variations of a new machine model Conf Record 17th Annual IEEE Symp on Foundauons of Computer Science, Houston, Texas, 1976, pp 228-235

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE conference on Design automation
  Gwo-Dong Chen ,  Daniel D. Gajski