Skip to main content
SpringerLink
Log in

Variants of top-down tree transducers with look-ahead

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

In this article we consider deterministic and strongly deterministic top-down tree transducers with regular look-ahead, with regular check, with deterministic top-down look-ahead, and with deterministic top-down check. We compare the transformational power of these tree transducer classes by giving a correct inclusion diagram of the tree transformation classes induced by them. Along with the comparison we decompose some of the examined classes into simpler classes and we introduce the concept of the deterministic top-down tree automata with deterministic top-down look-ahead. We show that these recognizers recognize a tree language class which is strictly between the class of regular tree languages and the class of tree languages recognizable by deterministic top-down tree automata. We also study the closure properties of the examined tree transformation classes. We show that some classes are closed under composition while others, for example the class of tree transformations induced by deterministic top-down tree transducers with deterministic top-down look-ahead, are not.

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. B. S. Baker, Composition of top-down and bottom-up tree transductions,Information and Control,41, 186–213 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  2. P. M. Cohn,Universal Algebra, Harper & Row, New York, 1965.

    MATH  Google Scholar 

  3. B. Courcelle, A representation of trees by languages, II,Theoretical Computer Science,7, 25–55 (1978).

    Article  MathSciNet  MATH  Google Scholar 

  4. J. Engelfriet, Bottom-up and top-down tree transformations—A comparison,Mathematical Systems Theory,9, 198–231 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  5. J. Engelfriet, On tree transducers for partial functions,Information Processing Letters,7, 170–172 (1977).

    Article  MathSciNet  Google Scholar 

  6. J. Engelfriet, Top-down tree transducers with regular look-ahead,Mathematical Systems Theory,10, 289–303 (1976/77).

    Article  MathSciNet  Google Scholar 

  7. Z. Fülöp and S. Vágvölgyi, Top-down tree transducers with deterministic top-down look-ahead, submitted for publication.

  8. F. Gécseg and M. Steinby,Tree Automata, Akadémiai Kiadó, Budapest, 1984.

    MATH  Google Scholar 

  9. W. C. Rounds, Mappings and grammars on trees,Mathematical Systems Theory,4, 257–287 (1970).

    Article  MathSciNet  MATH  Google Scholar 

  10. M. Takahashi, Generalizations of regular sets and their application to a study of context-free languages,Information and Control,27, 1–36 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  11. J. Virágh, Deterministic ascending tree automata, I,Acta Cybernetica,5, 33–42 (1980).

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Group on Theory of Automata, Hungarian Academy of Sciences, Somogyi u. 7, H-6720, Szeged, Hungary

    Zoltán Fülöp & Sándor Vágvölgyi

Authors
  1. Zoltán Fülöp
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sándor Vágvölgyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fülöp, Z., Vágvölgyi, S. Variants of top-down tree transducers with look-ahead. Math. Systems Theory 21, 125–145 (1988). https://doi.org/10.1007/BF02088010

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation