Weighted tree transducers

  • Authors:

  • Zoltán Fülöp;Heiko Vogler

  • Affiliations:

  • Department of Computer Science, University of Szeged, Árpád tér 2, H-6720 Szeged, Hungary;Faculty of Computer Science, Dresden University of Technology, D-01062 Dresden, Germany

  • Venue:
  • Journal of Automata, Languages and Combinatorics
  • Year:
  • 2004

Quantified Score

Hi-index 0.02

Visualization

Abstract

In recent investigations, tree transducers were generalized to tree series transducers [21, 8, 12] by allowing tree series as output rather than trees, where a tree series is a mapping from output trees to some semiring. The semantics of tree series transducers was defined in an algebraic framework, more precisely, as an initial algebra semantics. In this paper we suggest an alternative approach by introducing weighted tree transducers, of which the semantics is defined in an operational style. A weighted tree transducer is a tree transducer each (term rewriting) rule of which is associated with a weight taken from a semiring. Along a successful derivation the weights of the involved rules are multiplied and, for every pair of input tree and output tree, the weights of its successful derivations are summed up. We show in a constructive way that the two approaches, i.e., tree series transducers and weighted tree transducers, are semantically equivalent for both, the top-down and the bottom-up case.