Mappings and grammars on trees. (English) Zbl 0203.30103


Full Text: DOI


[1] A. V. Aho, Indexed grammars–an extension of the context-free grammars,J. Assoc. Comput. Mach. 15 (1968), 647–671. · Zbl 0175.27801
[2] A. V. Aho andJ. D. Ullman, Automaton analogs of syntax-directed translation schemata,Proc. 9th IEEE Ann. Symp. on Switching and Automata Theory, October, 1968.
[3] A. V. Aho andJ. D. Ullman, Translations on a context-free grammar,Proc. Assoc. Comput. Mach. Symp. on Theory of Computing, May, 1969. · Zbl 1282.68147
[4] M. A. Arbib andY. Give’on, Algebra automata I: Parallel programming as a prolegomena to the categorical approach,Information and Control 12 (1968), 331–345. · Zbl 0164.32201 · doi:10.1016/S0019-9958(68)90374-4
[5] W. S. Brainerd, The minimalization of tree automata,Information and Control 13 (1968), 484–491. · Zbl 0181.01602 · doi:10.1016/S0019-9958(68)90917-0
[6] W. S. Brainerd, Tree generating regular systems,Information and Control 14 (1969), 217–231. · Zbl 0169.31601 · doi:10.1016/S0019-9958(69)90065-5
[7] N. Chomsky,Aspects of the Theory of Syntax, M.I.T. Press, Cambridge, Mass., 1965.
[8] J. E. Doner, Tree acceptors and some of their applications, System Development Corp., Scientific Report No. 8 (1967). · Zbl 0212.02901
[9] M. J. Fischer, Grammars with macro-like productions,Proc. 9th IEEE Symp. on Switching and Automata Theory, October, 1968.
[10] E. T. Irons, A syntax-directed compiler for ALGOL 60,Comm. ACM 4 (1961), 51–55. · Zbl 0103.34904 · doi:10.1145/366062.366083
[11] P. M. Lewis andR. E. Stearns, Syntax-directed transduction,J. Assoc. Comput. Mach. 15 (1968), 465–488. · Zbl 0164.32102
[12] J. Mezei andJ. B. Wright, Algebraic automata and context-free sets,Information and Control 11 (1967), 3–29. · Zbl 0155.34301 · doi:10.1016/S0019-9958(67)90353-1
[13] M. O. Rabin, Mathematical Theory of Automata,Mathematical Aspects of Computer Science, Proc. Symposia Appl. Math., XIX, 173–175, American Mathematical Society, Providence, R.I., 1967. · Zbl 0189.01304
[14] W. C. Rounds, Trees, transducers, and transformations, Dissertation, Stanford University, August, 1968.
[15] J. W. Thatcher, Characterizing derivation trees of context-free grammars through a generalization of finite automata theory,J. Comput. System Sci. 1 (1967), 317–322. · Zbl 0155.01802 · doi:10.1016/S0022-0000(67)80022-9
[16] J. W. Thatcher, Transformations and translations from the point of view of generalized finite automata theory,Proc. Assoc. Comput. Mach. Conference on Theory of Computing, May, 1969. · Zbl 1282.68172
[17] J. W. Thatcher andJ. B. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic,Math. Systems Theory 2 (1968), 57–81. · Zbl 0196.01901 · doi:10.1007/BF01691346
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.