Advertisement

Mathematical systems theory

, Volume 21, Issue 1, pp 125–145 | Cite as

Variants of top-down tree transducers with look-ahead

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

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.

Keywords

Function Symbol Closure Property Input Tree Tree Automaton Tree Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B. S. Baker, Composition of top-down and bottom-up tree transductions,Information and Control,41, 186–213 (1979).CrossRefMathSciNetzbMATHGoogle Scholar
  2. [2]
    P. M. Cohn,Universal Algebra, Harper & Row, New York, 1965.zbMATHGoogle Scholar
  3. [3]
    B. Courcelle, A representation of trees by languages, II,Theoretical Computer Science,7, 25–55 (1978).CrossRefMathSciNetzbMATHGoogle Scholar
  4. [4]
    J. Engelfriet, Bottom-up and top-down tree transformations—A comparison,Mathematical Systems Theory,9, 198–231 (1975).CrossRefMathSciNetzbMATHGoogle Scholar
  5. [5]
    J. Engelfriet, On tree transducers for partial functions,Information Processing Letters,7, 170–172 (1977).CrossRefMathSciNetGoogle Scholar
  6. [6]
    J. Engelfriet, Top-down tree transducers with regular look-ahead,Mathematical Systems Theory,10, 289–303 (1976/77).CrossRefMathSciNetGoogle Scholar
  7. [7]
    Z. Fülöp and S. Vágvölgyi, Top-down tree transducers with deterministic top-down look-ahead, submitted for publication.Google Scholar
  8. [8]
    F. Gécseg and M. Steinby,Tree Automata, Akadémiai Kiadó, Budapest, 1984.zbMATHGoogle Scholar
  9. [9]
    W. C. Rounds, Mappings and grammars on trees,Mathematical Systems Theory,4, 257–287 (1970).CrossRefMathSciNetzbMATHGoogle Scholar
  10. [10]
    M. Takahashi, Generalizations of regular sets and their application to a study of context-free languages,Information and Control,27, 1–36 (1975).CrossRefMathSciNetzbMATHGoogle Scholar
  11. [11]
    J. Virágh, Deterministic ascending tree automata, I,Acta Cybernetica,5, 33–42 (1980).MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag New York Inc 1988

Authors and Affiliations

  • Zoltán Fülöp
    • 1
  • Sándor Vágvölgyi
    • 1
  1. 1.Research Group on Theory of AutomataHungarian Academy of SciencesSzegedHungary

Personalised recommendations