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
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

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

Formal Power Series over Trees.

Developments in Language Theory • 1997
View 5 Excerpts
Highly Influenced

Bottom-Up and Top-Down Tree Series Transformations

Journal of Automata, Languages and Combinatorics • 2002
View 5 Excerpts
Highly Influenced

Tree Series Transformations that Respect Copying

Theory of Computing Systems • 2003
View 2 Excerpts

Equational Elements in Additive Algebras

Theory of Computing Systems • 1999
View 1 Excerpt

Handbook of Formal Languages

von Grzegorz Rozenberg
Springer Berlin Heidelberg • 1997
View 1 Excerpt

Semirings, Automata, Languages

EATCS Monographs on Theoretical Computer Science • 1986
View 1 Excerpt

Some open questions and recent results on tree transducers and tree languages

J. Engelfriet
In Book, R.V., ed.: Formal Language Theory – Perspectives and Open Problems. Academic Press • 1980