A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
The Generating Power of Total Deterministic Tree Transducers
1998
Information and Computation
Preserved Fulltext
One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that arbitrary trees over a ranked alphabet are taken as input, instead of derivation trees of a context-free ...
Attributed tree transducers are abstract models to study properties of attribute grammars. ...
I am grateful to Joost Engelfriet for the tremendous amount of helpful comments and suggestions for improvements on an earlier version of this paper. ...
doi:10.1006/inco.1998.2736
fatcat:bpji5u4kabcyxpgbxsptcr7ka4
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
2000
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The attributed tree transducer is an attribute grammar in which all attributes are trees; it is preceded by a look-ahead phase in which all attributes have finitely many values. ...
Two well-known formalisms for the specification and computation of tree transductions are compared: the mso graph transducer and the attributed tree transducer with look-ahead, respectively. ...
On the other hand, attributed tree transducers have copy rules by which they can transport attribute values through the tree. ...
doi:10.1006/jcss.1999.1684
fatcat:tnehitak4jgthgj5ll3firaa7i
Tree transducers with external functions
1993
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, not every macro tree transducer can be transformed into a one-visit attributed tree transducer, not even into an arbitrary noncircular attributed tree transducer. ...
The first example illustrates the main idea of transforming a simple macro tree transducer into a one-visit attributed tree transducer. ...
These are tree transducers in which the ranked alphabets of output symbols can contain special symbols, called external function symbols, which are interpreted by tree functions taken from an arbitrary ...
doi:10.1016/0304-3975(93)90191-u
fatcat:44tpmvynrranlej5ovqcqmkoc4
Composing Stack-Attributed Tree Transducers
2008
Theory of Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents a composition method for stack-attributed tree transducers. Stackattributed tree transducers extend attributed tree transducers with a pushdown stack device for attribute values. ...
Stack-attributed tree transducers are more powerful than attributed tree transducers due to the stack mechanism. ...
Stack-Attributed Tree Transducers In this section, we give the definition of attributed tree transducers(ATT) and stack-attributed tree transducers(SATT). ...
doi:10.1007/s00224-008-9125-y
fatcat:jvzxtr5drbbidclkzipxlpa3wy
Approximate Data Exchange
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We consider a model based on transducers of words and trees, and study ε-Consistency, i.e., the problem of deciding whether a given source instance I is -close to a source I , whose image by a transducer ...
We also show that ε-Typechecking on words can be solved in polynomial time, whereas the exact problem is PSPACE-complete. ...
We showed that for the Edit distance with Moves, ε-Source-consistency is testable on words and trees, and that ε-Typechecking is polynomial on words. ...
doi:10.1007/11965893_4
fatcat:yd4slxwoojgvzka7mdx356ulwa
Context-Free Grammars with Storage
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Taking particular storage types gives particular formalisms, such as indexed grammars, top-down tree transducers, attribute grammars, etc. ...
The context-free S languages can be obtained from the deterministic one-way S automaton languages by way of the delta operations on languages, introduced in this paper. ...
indexed tree transducers), in the same way as attribute gram-
mars are equivalent to DRT(Tree-walk) transducers ...
arXiv:1408.0683v1
fatcat:sr2by746tvfenjsotqqop67v2a
Page 5773 of Mathematical Reviews Vol. , Issue 2000h
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
It studies several classes of tree transducers and the relationships among these classes. The book contains an extensive bibliography of the literature on tree transducers. ...
A tree transducer is a formal model of a tree-to-tree translator. ...
Page 3418 of Mathematical Reviews Vol. , Issue 83h
[page]
1983
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We show that the domain of attributed tree transformations is a regular tree language, and an alternative proof is given for the decidability of the K-visit property of deterministic attributed tree-transducers ...
The proof is based on a decomposition result for linear (tree-) homomorphisms which is of interest on its own. ...
Approximate schemas, source-consistency and query answering
2008
Journal of Intelligent Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A transducer model is introduced to compare tree languages (schemas) with different alphabets and attributes. ...
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are ε-close if every word (tree) of one language is ε-close to the other. ...
There is a large literature on tree transducers and our model is close to the top-down tree transducers of [11] , but also handles attributes values. ...
doi:10.1007/s10844-008-0060-9
fatcat:vwch5mpa4jhm5owh3k7umfetja
Towards the Tree Automata Workbench Marbles
2010
Electronic Communications of the EASST
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The goal is to design and implement an extensible system that facilitates experiments with virtually any kind of algorithm on tree automata. ...
The conceptual ideas that are intended to become the basis for the tree automata workbench Marbles are sketched. ...
many more years of continued scientific productivity to come, and want to conclude this paper by paraphrasing the final sentence you once formulated in our survey paper [DK99] : Whichever serious goals one ...
doi:10.14279/tuj.eceasst.26.360
dblp:journals/eceasst/Drewes10
fatcat:oyaez6acinbojef6ar3w5ponpy
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time
[chapter]
2019
Green Chemistry and Sustainable Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
macro tree transducers. ...
We also consider extensions of this result to partial transducers and to the case where parameters of transducers accumulate strings instead of trees. ...
For instance, attributed grammars without inherited attributes are equivalent to deterministic top-down tree transducers (DT) [3, 5] . ...
doi:10.1007/978-3-030-17127-8_28
dblp:conf/fossacs/SeidlPM19
fatcat:i24y2qbvnfb6pckp6fdi3htgyq
The time complexity of typechecking tree-walking tree transducers
2008
Acta Informatica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Tree-walking tree transducers can be typechecked in double exponential time. More generally, compositions of k tree-walking tree transducers can be typechecked in (k + 1)-fold exponential time. ...
Consequently k-pebble tree transducers, which form a model of XML transformations and XML queries, can be typechecked in (k + 2)-fold exponential time. ...
An attribute grammar for which the values of the attributes are trees, i.e., unevaluated expressions, is called an attributed tree transducer (see [7, 8] ). ...
doi:10.1007/s00236-008-0087-y
fatcat:v3jqh47k3zfbtms7gvtrb46tby
Tree automata and attribute grammars
1983
Information and Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The pushdown tree-to-string transducer with a certain synchronization facility as a model to realize transformations by attribute grammars is proposed and its basic properties using tree-walking finite ...
The translational mechanism of attribute grammars using tree automata are investigated. ...
Unlike the attributed pushdown transducer of Lewis et al. (1974) , our tranducer directly operates on trees, and it is a more conventional type of device than the macro tree transducer or the recursive ...
doi:10.1016/s0019-9958(83)80021-7
fatcat:tdne5xskirdhze2tucvvewys54
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
macro tree transducers. ...
We also consider extensions of this result to partial transducers and to the case where parameters of transducers accumulate strings instead of trees. ...
The proof is similar to the one of [9, Theorem 8] for top-down tree transducers. ...
arXiv:1902.03858v1
fatcat:keumy7xwszdfzd6up2zelezm2y
Page 3064 of Mathematical Reviews Vol. , Issue 96e
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The paper deals only with deterministic attributed tree transducers. ...
[Vogler, Heiko] (D-TUDI-ST; Dresden)
A pumping lemma for output languages of attributed tree transducers. (English summary)
Acta Cybernet. 11 (1994), no. 4, 261-305.
Attributed tree transducers [Z. ...
« Previous
Showing results 1 — 15 out of 20,689 results