Skip to main content
SpringerLink
Log in

Transductions of dags and trees

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

Directed acyclic graphs (dags) model derivations of phrasestructure grammars analogously to the way that trees model derivations of context-free grammars.

In this paper we introduce translations of such dags which naturally extend the bottom-up tree translations. Composition results of these dag-to-tree transformations are studied. It is shown that every “recursively enumerable tree language” can be obtained from a recognizable dag language by such a transduction. Tree languages obtained from some subsets of recognizable dag languages by these transductions are investigated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arbib, M. A. and Give'on, Y.: Algebra Automata I: Parallel Programming as a Prelogomena to the Categorical Approach;Information and Control 12, 331–345 (1968).

    Google Scholar 

  2. Aho, A. V. and Ullman, J. D.: Transformations on Straight Line Programs: Proc. of 2nd Annual ACM STOC, Northhampton, Mass., 136–148 (1970).

  3. Aho, A. V. and Ullman, J. D.: Translations on a Context-Free Grammar;Information and Control,19, 439–475 (1971).

    Google Scholar 

  4. Baker, B. S.: Tree Transductions and Families of Tree Languages; Ph. D. Thesis, Harvard University (1973).

  5. Baker, B. S.: Generalized Syntax Directed Translation, Tree Transducers, and Linear Space;SIAM J. of Computing 7, 376–391 (1978).

    Google Scholar 

  6. Baker, B.S.: Compositions of top-down and bottom-up tree transductions;Information and Control 41, 186–213 (1979).

    Google Scholar 

  7. Benson, D. B.: Semantic Preserving Translations;Math Syst. Theory 8, 105–126 (1974).

    Google Scholar 

  8. Buttelmann, H. W.: On the Syntactic Structure of Unrestricted Grammars, I and II;Information and Control 29, 29–101 (1975).

    Google Scholar 

  9. Engelfriet, J.: Bottom-up and Top-down Tree Transformations—a comparison;Math Syst. Theory 9, 193–231 (1975).

    Google Scholar 

  10. Engelfriet, J.: Tree Automata and Tree Grammars; Lecture Notes DAIMI FN-10, University of Aarhus, Denmark (1975).

    Google Scholar 

  11. Engelfriet, J.: Top-down Tree Transducers with Regular Lookahead;Math Syst. Theory 10, 289–303 (1977).

    Google Scholar 

  12. Engelfriet, J.: Three Hierarchies of Transducers; Memorandum NR. 217, Twente University of Technology, Holland (1978).

    Google Scholar 

  13. Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree Transducers,L-systems, and Two-way Machines; Proc. 10th Annual ACM STOC, San Diego, California, 66–74 (1978).

  14. Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree Transducers,L-systems, and Two-way Machines;JCSS 20, 150–202 (1980).

    Google Scholar 

  15. Hart, J. M.: Acceptors for the Derivation Language of Phrase-Structure Grammars;Information and Control 25, 75–92 (1974).

    Google Scholar 

  16. Kamimura, T.: Automata on Directed Acyclic Graphs; Ph.D. Thesis, University of Delaware (1979).

  17. Kamimura, T. and Slutzki, G.: Dags and Chomsky Hierarchy; ICALP '79; Graz, Austria, 331–337 (1979).

  18. Kamimura, T. and Slutzki, G.: Parallel and Two-way Recognizers of Directed Acyclic Graphs; MFCS '79, Olomouc, Czechoslovakia, 317–325 (1979). (To appear inInformation and Control.)

  19. Kamimura, T. and Slutzki, G.: Paths in Dag Languages: TR 79/1, Department of Computer and Information Sciences, University of Delaware, Newark, Delaware (1979).

    Google Scholar 

  20. Odgen, W. F. and Rounds, W. C.: Composition ofn Tree Transducers; Proc. 4th Annual ACM STOC, Denver, Colorado, 198–206 (1972).

  21. Rounds, W. C.: Mappings and Grammars on Trees:Math Syst. Theory 4, 257–287 (1970).

    Google Scholar 

  22. Thatcher, J. W.: Tree Automata: Informal Survey; in Currents in the Theory of Computing (A. V. Aho, Ed.), Prentice-Hall, Englewood Cliffs, 143–172 (1973).

    Google Scholar 

  23. Thatcher, J. W.: Generalized2 Sequential Machine Maps;JCSS 4, 339–367 (1970).

    Google Scholar 

  24. Thatcher, J. W. and Wright, J. B.: Generalized Finite Automata Theory with Application to a Decision Problem of Second Order Logic;Math Syst. Theory 2, 57–81 (1968).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kansas, Lawrence, Kansas, USA

    Tsutomu Kamimura & Giora Slutzki

Authors
  1. Tsutomu Kamimura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giora Slutzki
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work of the first author was supported in part by University of Kansas General Research allocation #3015-20-0038.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kamimura, T., Slutzki, G. Transductions of dags and trees. Math. Systems Theory 15, 225–249 (1981). https://doi.org/10.1007/BF01786981

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01786981

Keywords

Search

Navigation