Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations
In this paper we investigate the relationship between classes of tree-to-tree-series (for short: t-ts) and o-tree-to-tree-series (for short: o-t-ts) transformations computed by restricted deterministic bottom-up weighted tree transducers (for short: deterministic bu-w-tt). Essentially, deterministic...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | English |
Published: |
Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden
2012
|
Subjects: | |
Online Access: | http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-99211 http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-99211 http://www.qucosa.de/fileadmin/data/qucosa/documents/9921/tud_TB_2004-07.pdf |
id |
ndltd-DRESDEN-oai-qucosa.de-bsz-14-qucosa-99211 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-DRESDEN-oai-qucosa.de-bsz-14-qucosa-992112013-01-07T20:06:37Z Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations Maletti, Andreas bottom-up tree-to-tree-series tree series tree series transducers ddc:004 rvk:SS 5514 In this paper we investigate the relationship between classes of tree-to-tree-series (for short: t-ts) and o-tree-to-tree-series (for short: o-t-ts) transformations computed by restricted deterministic bottom-up weighted tree transducers (for short: deterministic bu-w-tt). Essentially, deterministic bu-w-tt are deterministic bottom-up tree series transducers [EFV02, FV03, ful, FGV04], but the former are de ned over monoids whereas the latter are de ned over semirings and only use the multiplicative monoid thereof. In particular, the common restrictions of non-deletion, linearity, totality, and homomorphism [Eng75] can equivalently be de ned for deterministic bu-w-tt. Using well-known results of classical tree transducer theory (cf., e.g., [Eng75, Fül91]) and also new results on deterministic bu-w-tt, we order classes of t-ts and o-t-ts transformations computed by restricted deterministic bu-w-tt by set inclusion. More precisely, for every commutative monoid we completely specify the inclusion relation of the classes of t-ts and o-t-ts transformations for all sensible combinations of restrictions by means of inclusion diagrams. Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden Technische Universität Dresden, Fakultät Informatik 2012-11-12 doc-type:workingPaper application/pdf http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-99211 urn:nbn:de:bsz:14-qucosa-99211 issn:1430-211X PPN374794154 http://www.qucosa.de/fileadmin/data/qucosa/documents/9921/tud_TB_2004-07.pdf eng dcterms:isPartOf:Technische Berichte / Technische Universität Dresden, Fakultät Informatik ; 2004,07 (TUD-FI04-07 — May 2004) |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
topic |
bottom-up tree-to-tree-series tree series tree series transducers ddc:004 rvk:SS 5514 |
spellingShingle |
bottom-up tree-to-tree-series tree series tree series transducers ddc:004 rvk:SS 5514 Maletti, Andreas Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations |
description |
In this paper we investigate the relationship between classes of tree-to-tree-series (for short: t-ts) and o-tree-to-tree-series (for short: o-t-ts) transformations computed by restricted deterministic bottom-up weighted tree transducers (for short: deterministic bu-w-tt). Essentially, deterministic bu-w-tt are deterministic bottom-up tree series transducers [EFV02, FV03, ful, FGV04], but the former are de ned over monoids whereas the latter are de ned over semirings and only use the multiplicative monoid thereof. In particular, the common restrictions of non-deletion, linearity, totality, and homomorphism [Eng75] can equivalently be de ned for deterministic bu-w-tt.
Using well-known results of classical tree transducer theory (cf., e.g., [Eng75, Fül91]) and also new results on deterministic bu-w-tt, we order classes of t-ts and o-t-ts transformations computed by restricted deterministic bu-w-tt by set inclusion. More precisely, for every commutative monoid we completely specify the inclusion relation of the classes of t-ts and o-t-ts transformations for all sensible combinations of restrictions by means of inclusion diagrams. |
author2 |
Technische Universität Dresden, Fakultät Informatik |
author_facet |
Technische Universität Dresden, Fakultät Informatik Maletti, Andreas |
author |
Maletti, Andreas |
author_sort |
Maletti, Andreas |
title |
Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations |
title_short |
Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations |
title_full |
Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations |
title_fullStr |
Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations |
title_full_unstemmed |
Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations |
title_sort |
inclusion diagrams for classes of deterministic bottom-up tree-to-tree-series transformations |
publisher |
Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden |
publishDate |
2012 |
url |
http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-99211 http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-99211 http://www.qucosa.de/fileadmin/data/qucosa/documents/9921/tud_TB_2004-07.pdf |
work_keys_str_mv |
AT malettiandreas inclusiondiagramsforclassesofdeterministicbottomuptreetotreeseriestransformations |
_version_ |
1716473151076958208 |