Výsledky vyhledávání - "Tree transducer"

Equivalence of Linear Tree Transducers with Output in the Free Group

Autor: Löbel, Raphaela, Luttenberger, Michael, Seidl, Helmut

Publikováno v: Developments in Language Theory

We show that equivalence of deterministic linear tree transducers can be decided in polynomial time when their outputs are interpreted over the free group. Due to the cancellation properties offered by the free group, the required constructions are n

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8a52759bb9fe7312cf01e5ffe36071b
http://europepmc.org/articles/PMC7247876

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time

Autor: Adrien Boiret, Raphaela Palenta

Publikováno v: Lecture Notes in Computer Science
20th International Conference on Developments in Language Theory (DLT 2016)
20th International Conference on Developments in Language Theory (DLT 2016), Jul 2016, Montreal, Canada. pp.355-367, ⟨10.1007/978-3-662-53132-7_29⟩
Developments in Language Theory ISBN: 9783662531310
DLT

We show that the equivalence of deterministic linear top-down tree-to-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not necessarily order-preserving and can be used to express XML and other docu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e097f705d91ab429f59caee30f2f453
https://hal.archives-ouvertes.fr/hal-01429110/document

Zobrazit plný text záznamu

Dissertation/ Thesis

Une théorie mécanisée des arbres réguliers en théorie des types dépendants

Autor: Spadotti, Régis

Nous proposons deux caractérisations des arbres réguliers. La première est sémantique et s'appuie sur les types co-inductifs. La seconde est syntaxique et repose sur une représentation des arbres réguliers par des termes cycliques. Nous prouvon

Externí odkaz: http://www.theses.fr/2016TOU30178/document

Zobrazit plný text záznamu

Deterministic bottom-up tree transducers and ground term rewrite systems

Autor: Sándor Vágvölgyi

Publikováno v: Theoretical Computer Science. 410:2250-2278

We show that it is decidable for any deterministic bottom-up tree transducer A and ground term rewrite system R, which one of the following conditions holds: (i) @t(A)@?@?"R^*, (ii) @?"R^*@?@t(A), (iii) @t(A)=@?"R^*, (iv) @t(A) and @?"R^* are incompa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68934134de5ec0567422ba9dccc13a21
https://doi.org/10.1016/j.tcs.2009.02.040

Zobrazit plný text záznamu

HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations

Autor: Andreas Maletti

Publikováno v: Theoretical Computer Science. 339(2-3):200-240

The relationship between classes of tree-to-tree-series and o-tree-to-tree-series transformations computed by restricted deterministic bottom-up weighted tree transducers is investigated. Essentially, these transducers are deterministic bottom-up tre

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7344ff0d28d164f4ca25f66f428e0b2

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání