Advertisement

When is a functional tree transduction deterministic?

  • Helmut Seidl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 668)

Abstract

We give a decision procedure to determine whether or not the transduction of a functional transducer can be realized by a deterministic (resp. reduced deterministic) transducer. In case this is possible we exhibit a general construction to build this transducer.

Keywords

Polynomial Time Input Tree Tree Automaton Output Tree Tree Transducer 
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.

References

  1. 1.
    A.V. Aho, J.E. Hopcroft, J.D. Ullman: The design and analysis of computer algorithms. Addison-Wesley, 1974Google Scholar
  2. 2.
    J. Berstel: Transductions and Context-Free Languages. Teubner, Stuttgart, 1979Google Scholar
  3. 3.
    J. Engelfriet: Some open questions and recent results on tree transducers and tree languages. In: Formal Language Theory, ed. by R.V. Book, Academic Press 1980, pp. 241–286Google Scholar
  4. 4.
    Chr. Ferdinand, H. Seidl, R. Wilhelm: Tree automata for code selection. In: R. Giegerich, S.L. Graham (eds): Code Generation — Concepts, Tools, Techniques. Springer, Workshops in Computing, pp. 31–50, 1992Google Scholar
  5. 5.
    F. Gecseg, M. Steinby: Tree automata. Akademiai Kiado, Budapest, 1984Google Scholar
  6. 6.
    R. Giegerich, K. Schmal: Code selection techniques: pattern matching, tree parsing and inversion of derivors. Proc. of ESOP 1988, LNCS 300 pp. 245–268Google Scholar
  7. 7.
    C. Reutenauer: Subsequential Functions: Characterizations, Minimization, Examples. Proc. IMYCS 1990, LNCS 464, pp. 62–79Google Scholar
  8. 8.
    H. Seidl: Equivalence of finite-valued bottom-up finite state tree transducers is decidable. Proc. CAAP '90, LNCS 431, pp. 269–284, 1990; extended version to appear in: Math. Syst. TheoryGoogle Scholar
  9. 9.
    H. Seidl: Single-valuedness of tree transducers is decidable in polynomial time. To appear in: TCS, special issue of CAAP 90Google Scholar
  10. 10.
    A. Weber, R. Klemm: Economy of Description for Single-valued Transducers. Preprint J.W.Goethe-Universität, Frankfurt/Main, 1991Google Scholar
  11. 11.
    Z. Zachar: The solvability of the equivalence problem for deterministic frontierto-root tree transducers. Acta Cybernetica 4 (1978), pp. 167–177Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Helmut Seidl
    • 1
  1. 1.Fachbereich InformatikUniversität des SaarlandesSaarbrückenGermany

Personalised recommendations