Relating Tree Series Transducers and Weighted Tree Automata

@inproceedings{Maletti2004RelatingTS,
  title={Relating Tree Series Transducers and Weighted Tree Automata},
  author={Andreas Maletti},
  booktitle={Developments in Language Theory},
  year={2004}
}
In this paper we implement bottom-up tree series transducers (tst) over the semiring A with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore we firstly introduce bottom-up DM-monoid weighted tree automata (DM-wta), which essentially are wta using an operation symbol of a DM-monoid instead of a semiring element as transition weight. Secondly, we show that DMwta are indeed a generalization of tst (using pure substitution). Thirdly, given a DM-wta over a DM… CONTINUE READING
BETA

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Similar Papers

Loading similar papers…