Preservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers

  title={Preservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers},
  author={Nina Seemann and Daniel Quernheim and Fabienne Braune and Andreas Maletti},
An open question in [FÜLÖP, MALETTI, VOGLER: Weighted extended tree transducers. Fundamenta Informaticae 111(2), 2011] asks whether weighted linear extended tree transducers preserve recognizability in countably complete commutative semirings. In this contribution, the question is answered positively, which is achieved with a construction that utilizes inside weights. Due to the completeness of the semiring, the inside weights always exist, but the construction is only effective if they can be… CONTINUE READING
1 Extracted Citations
28 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 28 references

Weighted tree automata and tree transducers . In Manfred Droste , Werner Kuich , and Heiko Vogler , editors , Handbook of Weighted Automata , EATCS Monographs on Theoret

  • Heiko Vogler
  • Comput . Sci .
  • 2009
Highly Influential
5 Excerpts

The power of extended top-down tree transducers

  • Jonathan Graehl, Mark Hopkins, Kevin Knight, Andreas Maletti.
  • SIAM J. Comput., 39(2):410–430.
  • 2009
Highly Influential
4 Excerpts

The Theory of Recognizable Tree Series

  • Björn Borchardt.
  • Ph.D. thesis, Technische Universität Dresden.
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…