@article{HanneforthMalettiQuernheim2018,
  author    = {Hanneforth, Thomas and Maletti, Andreas and Quernheim, Daniel},
  title     = {Pushing for weighted tree automata},
  series = {Logical Methods in Computer Science},
  volume    = {14},
  journal   = {Logical Methods in Computer Science},
  number    = {1},
  publisher = {Logical Methods in Computer Science E V},
  address   = {Braunschweig},
  issn      = {1860-5974},
  doi       = {10.23638/LMCS-14(1:5)2018},
  pages     = {16},
  year      = {2018},
  abstract  = {A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized weighted tree language even for nondeterministic wta, but it is most useful for bottom-up deterministic wta, where it can be used for minimization and equivalence testing. In both applications a careful selection of the weights to be redistributed followed by normalization allows a reduction of the general problem to the corresponding problem for bottom-up deterministic unweighted tree automata. This approach was already successfully used by Mohri and Eisner for the minimization of deterministic weighted string automata. Moreover, the new equivalence test for two wta M and M′ runs in time O((|M|+|M′|)⋅log(|Q|+|Q′|)), where Q and Q′ are the states of M and M′, respectively, which improves the previously best run-time O(|M|⋅|M′|).},
  language  = {en}
}
@article{MalettiGraehlHopkinsetal.2009,
  author    = {Maletti, Andreas and Graehl, Jonathan and Hopkins, Mark and Knight, Kevin},
  title     = {The power of extended top-down tree transducers},
  issn      = {0097-5397},
  doi       = {10.1137/070699160},
  year      = {2009},
  abstract  = {Extended top-down tree transducers (transducteurs generalises descendants; see [A. Arnold and M. Dauchet, Bi- transductions de forets, in Proceedings of the 3rd International Colloquium on Automata, Languages and Programming, Edinburgh University Press, Edinburgh, 1976, pp. 74-86]) received renewed interest in the field of natural language processing. Here those transducers are extensively and systematically studied. Their main properties are identified and their relation to classical top-down tree transducers is exactly characterized. The obtained properties completely explain the Hasse diagram of the induced classes of tree transformations. In addition, it is shown that most interesting classes of transformations computed by extended top-down tree transducers are not closed under composition.},
  language  = {en}
}