Abstract
Composition of top-down tree transducers yields a proper hierarchy of transductions and of output languages. The same is true for ETOL systems (viewed as transducers) and for two-way generalized sequential machines.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. V. Aho, Indexed grammars—an extension of context-free grammars,JACM 15, 647–671 (1968).
A. V. Aho, J. E. Hopcroft and J. D. Ullman, A general theory of translation,Math. Syst. Th. 3, 193–221 (1969).
A. V. Aho and J. D. Ullman, A characterization of two-way deterministic classes of languages,JCSS 4, 523–538 (1970).
A. V. Aho and J. D. Ullman, Translations on a context-free grammar,Inf. and Control 19, 439–475 (1971).
A. Arnold and M. Dauchet, Translations de forets reconnaissables monadiques; forets coregulieres; RAIRO Informatique Theoretique 10, 5–28 (1976).
P. R. J. Asveld, Controlled iteration grammars and full hyper-AFLs,Inf. and Control 34, 248–269 (1977).
P. R. J. Asveld and J. Engelfriet, Iterated deterministic substitution,Acta Informatica 8, 285–302 (1977).
P. R. J. Asveld and J. van Leeuwen, Infinite chains of hyper-AFLs, Memorandum 99, Twente University of Technology, 1975.
B. S. Baker, Tree transductions and families of tree languages; Ph.D. Thesis; Harvard University, Report TR-9–73, 1973; see also references [44, 45, 46].
M. P. Chytil and V. Jákl, Serial composition of 2-way finite-state transducers and simple programs on strings; inFourth Colloquium on Automata, Languages and Programming, Turku, A. Salomaa and M. Steinby eds.,Lecture Notes in Computer Science 52, Springer-Verlag, Berlin, 1977.
A. Ehrenfeucht and G. Rozenberg, Three useful results concerningL languages without interactions; inL systeins, G. Rozenberg and A. Salomaa eds., pp. 72–77,Lecture Notes in Computer Science 15, Springer-Verlag, Berlin, 1974.
A. Ehrenfeucht and G. Rozenberg, On inverse homomorphic images of deterministic ETOL languages, inAutomata, Languages, Development, A. Lindenmayer and G. Rozenberg eds., pp. 179–189, North-Holland, Amsterdam, 1976.
R. W. Ehrich and S. S. Yau, Two-way sequential transductions and stack automata,Inf. and Control 18, 404–446 (1971).
G. S. Eisman, Derivation controlled Lindenmayer systems; excerpt from Ph.D. Thesis at University of California, Berkeley, 1977.
J. Engelfriet, Surface tree languages and parallel derivation trees,TCS 2, 9–27 (1976).
J. Engelfriet, Bottom-up and top-down tree transformations—a comparison,Math. Syst. Th. 9, 198–231 (1975).
J. Engelfriet, Top-down tree transducers with regular look-ahead,Math. Syst. Th. 10, 289–303 (1977).
J. Engelfriet, On tree transducers for partial functions;Inf. Proc. Letters 7, 170–172 (1978).
J. Engelfriet, G. Rozenberg and G. Slutzki: Tree transducers,L systems and two-way machines,JCSS 20, 150–202 (1980).
J. Engelfriet, E. Meineche Schmidt and J. van Leeuwen, Stack machines and classes of nonnested macro languages,JACM 27, 96–117 (1980).
J. Engelfriet and S. Skyum, Copying theorems,Inf. Proc. Letters 4, 157–161 (1976).
M. J. Fischer, Grammars with macro-like productions, Ph.D. Thesis, Harvard University, 1968.
S. Ginsburg,Algebraic and automata-theoretic properties of formal languages, North-Holland/American Elsevier, Amsterdam/New York, 1975.
S. A. Greibach, Chains of full AFLs,Math. Syst. Th. 4, 231–242 (1970).
S. A. Greibach, Syntactic operators on full semi-AFLs,JCSS 6, 30–76 (1972).
S. A. Greibach, One-way finite visit automata,TCS 6, 175–221 (1978).
S. A. Greibach, Hierarchy theorems for two-way finite state transducers,Acta Informatica 11, 89–101 (1978).
T. Hayashi, On derivation trees of indexed grammars—an extension of theuvwxy-Theorem. Publ. of the Research Inst. for Math. Sciences (Kyoto University) 9 (1973) 61–92.
J. E. Hopcroft and J. D. Ullman,Formal languages and their relation to automata, Addison-Wesley, Reading, Mass., 1969.
D. Kiel, Two-way±-transducers and AFL,JCSS 10, 88–109 (1975).
M. Latteux, EDTOL-systemes ultralineaires et operateurs associes, Publication no. 100, Université de Lille, 1977.
W. F. Ogden and W. C. Rounds: Composition ofn transducers; Fourth ACM Symposium on Theory of Computing, pp. 198–206, 1972.
C. R. Perrault, Intercalation lemmas for tree transducer languages,JCSS 13, 246–277 (1976).
V. Rajlich, Absolutely parallel grammars and two-way finite state transducers,JCSS 6, 324–342 (1972).
W. C. Rounds, Mappings and grammars on trees,Math. Syst. Th. 4, 257–287 (1970).
G. Rozenberg, Extensions of tabledOL-systems and languages,Int. J. Comp. Inform. Sci. 2, 311–336 (1973).
A. Salomaa, Macros, iterated substitution and Lindenmayer AFLs,DAIMI PB-18, University of Aarhus, 1973 (see alsoL Systems, G. Rozenberg and A. Salomaa eds.,Lecture Notes in Computer Science 15, pp. 250–253, Springer-Verlag, Berlin, 1974).
S. Skyum, Decomposition theorems for various kinds of languages parallel in nature,SIAM J. Comp. 5, 284–296 (1976).
J. W. Thatcher, Characterizing derivation trees of context-free grammars through a generalization of finite automata theory,JCSS 1, 317–322 (1967).
J. W. Thatcher, Generalized2 sequential machine maps,JCSS 4, 339–367 (1970).
J. W. Thatcher, Tree automata: an informal survey; inCurrents in the Theory of Computing (ed. A. V. Aho), Prentice-Hall, 1973.
J. van Leeuwen, Variations of a new machine model, 17th IEEE Symposium on Foundations of Computer Science, Houston, Texas, pp. 228–235 (1976).
J. Engelfriet, Two-way automata and checking automata, inFoundations of Computer Science III, eds. J. W. de Bakker and J. van Leeuwen, MC Tract 108, Mathematical Centre, Amsterdam, 1979.
B. S. Baker, Composition of top-down and bottom-up tree transductions,Inf. and Control 41, 186–213 (1979).
B. S. Baker, Generalized syntax directed translation, tree transducers, and linear space,SIAM J. Comput. 7, 376–391 (1978).
B. S. Baker, Tree transducers and tree languages,Inf. and Control 37, 241–266 (1978).
J. Engelfriet and S. Skyum, The copying power of one-state tree transducers, ReportDAIMI PB-91, Aarhus University, 1978, to appear inJCSS.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Engelfriet, J. Three hierarchies of transducers. Math. Systems Theory 15, 95–125 (1981). https://doi.org/10.1007/BF01786975
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01786975