The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 9249 of Mathematical Reviews Vol. , Issue 2001M
[page]
2001
Mathematical Reviews
Preserved Fulltext
We characterize the tree transformation classes induced by the four subclasses of attributed tree transducers considered in terms of macro tree transducers. ...
{For the entire collection see MR 2001i:05007.}
2001m:68095 68Q45 68Q42 68Q70
Fiiloép, Zoltan (H-SZEG-C; Szeged)
Characterizing important subclasses of attributed tree transformations by macro tree transducers ...
Page 5019 of Mathematical Reviews Vol. , Issue 2001G
[page]
2001
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.
5019 68Q Theory of computing
transformations computed by (noncircular) attributed tree trans- ducers, in terms of a subclass of macro tree transducers, called attributed-like macro tree transducers. ...
In fact, we prove formally that attributed tree transducers and attributed-like macro tree transducers generate the same class of tree transformations. ...
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. ...
I wish you 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 ...
doi:10.14279/tuj.eceasst.26.360
dblp:journals/eceasst/Drewes10
fatcat:oyaez6acinbojef6ar3w5ponpy
A Survey on Decidable Equivalence Problems for Tree Transducers
2015
International Journal of Foundations of 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.
The decidability of equivalence for three important classes of tree transducers is discussed. ...
There are two ways in which macro tree transducers can be seen as a combination of context-free tree grammars, invented by Rounds [71] and also known as "macro tree grammars" [42] , and the top-down tree ...
Acknowledgements I wish to thank Joost Engelfriet and the anonymous referee for many helpful comments on a previous version of this paper. ...
doi:10.1142/s0129054115400134
fatcat:5wxybcc6xjbvdg43rgst5c4r5a
Equivalence Problems for Tree Transducers: A Brief Survey
2014
Electronic Proceedings in 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 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The decidability of equivalence for three important classes of tree transducers is discussed. ...
Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree transducers, (2) linear size increase, i.e., MSO definable ...
Macro tree transducers are a combination of context-free tree grammars, invented by Rounds [57] and also known as "macro tree grammars" [34] , and the top-down tree transducer of Rounds and Thatcher ...
doi:10.4204/eptcs.151.5
fatcat:bso3z5x5tjgy5fnx5anekyudei
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. ...
Using techniques and results of tree automata theory, they obtained a number of important results on the tree-totree transformations by attribute grammars. ...
doi:10.1016/s0019-9958(83)80021-7
fatcat:tdne5xskirdhze2tucvvewys54
Tree Transducers and Formal Methods (Dagstuhl Seminar 13192)
2013
Dagstuhl Reports
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 aim of this Dagstuhl Seminar was to bring together researchers from various research areas related to the theory and application of tree transducers. ...
tree transducers. ...
They discussed practical aspects of early query answering, streaming of macro tree transducers using parallel streams, and stack attributed tree transducers, respectively. ...
doi:10.4230/dagrep.3.5.1
dblp:journals/dagstuhl-reports/ManethS13
fatcat:xxotqpzgnzc3zdlkk4zxsdot5i
Using Algebraic Properties and Function Fusion to Evaluate Tree Accumulations in Parallel
2019
Journal of Information Processing
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.
MTTs are simple but more expressive than attributed tree transducers (ATTs), which are tree transformations modeled by attribute grammars. ...
To satisfy these requirements, this paper focuses on macro tree transducers (MTTs) [5], [9] . ...
The work is supported by JSPS Grant-in-Aid for Young Researchers (B), 24700019. ...
doi:10.2197/ipsjjip.27.411
fatcat:ktypv3exg5hwdlqmygkg7ijpba
Pushdown machines for the macro tree transducer
1986
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 2019; you can also visit the original URL.
The file type is application/pdf.
We investigate characterizations of the class of tree (tree-to-string) translations which is induced by macro tree transducers (macro tree-to-string transducers, respectively). ...
Finally, we characterize the n-fold composition of total deterministic macro tree transducers by recursive pushdown machines with an iterated pushdown as storage, which is a pushdown of pushdowns of.. ...
Then, since for every n t> 0, AG" _ DtCFT(TR)" c_ AG "+1 [ 15] , the composition of attribute grammars is characterized by iterated pushdown tree transducers; more precisely, AG* --[,_Into DtRT(P" (TR ...
doi:10.1016/0304-3975(86)90052-6
fatcat:fm62zkw4l5ewtcuddtxs2fvxt4
Type Checking of Tree Walking Transducers
[chapter]
2012
Modern Applications of Automata Theory
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 2011; you can also visit the original URL.
The file type is application/pdf.
Here, a "type" means a regular set of trees specified by a finite-state tree automaton. ...
Tree walking transducers are an expressive formalism for reasoning about XSLT-like document transformations. ...
In general, we are interested in type checking of transformations formulated through tree walking transducers (2tts) and macro tree walking transducers (2mtts). ...
doi:10.1142/9789814271059_0011
fatcat:qahaifc35jcehlz7inga4f4jfe
Modular tree transducers
1991
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 2019; you can also visit the original URL.
The file type is application/pdf.
This aim is achieved by macro tree transducers [23, 8, 5 , 121 and attribute grammars [26] . ...
modules, modular tree transducers with n modules characterize the class of n-fold compositions of macro tree transducers. ...
Note that macro tree transducers are cr by d&nition. The class of cr modular tree transducers is denoted by ModT,,. ...
doi:10.1016/0304-3975(91)90353-4
fatcat:bzdrji4hmjbfnheydrb2qb5asq
A complete rewriting system for a monoid of tree transformation classes
1990
Information and Computation
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.
We take the set S of the seven fundamental deterministic root-to-frontier tree transformation classes 22. ...
We give a finite, complete rewriting system R over S (where the elements of S are considered now as denotations of the corresponding tree transformation classes) such that every element of R, viewed as ...
, 1970) , attributed tree transducers (Fiilop, i983) , macro tree transducers (Courcelle and Franchi-Zannettacci, 1982; Engelfriet and Vogler, 1985) , ground tree tranducers (Dauchet et al., 1987) ...
doi:10.1016/0890-5401(90)90054-l
fatcat:ljx3xs3mgvepfchhwhpxplxvs4
Macro Tree Translations of Linear Size Increase are MSO Definable
2003
SIAM journal on computing (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 2007; you can also visit the original URL.
The file type is application/pdf.
Similar results hold for attribute grammars, which define a subclass of the macro tree translations. ...
This gives a new characterization of the MSO definable tree translations in terms of macro tree transducers: they are exactly the macro tree translations of linear size increase. ...
An important part of tree transducer theory is to compare the formal power of these different models of transformation of tree-structured objects and to provide effective translations between these models ...
doi:10.1137/s0097539701394511
fatcat:atspd666bvaffoypzywgckg7wy
Visibly pushdown transducers
2018
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 2020; you can also visit the original URL.
The file type is application/pdf.
Therefore VPT define transformations from nested words to words and can be seen as a subclass of pushdown transducers. ...
Visibly pushdown transducers (VPT) extend visibly pushdown automata (VPA) with outputs. ...
This work was partially supported by ANR project DELTA, grant ANR-16-CE40-0007, by the ARC project "Transform" (Fédération Wallonie-Bruxelles), and the FNRS CDR project "Flare" J013116F. ...
doi:10.1016/j.jcss.2018.05.002
fatcat:yqiq2kfuwrhvzlnldlpb2qwsii
The Power of Extended Top-Down Tree Transducers
2009
SIAM journal on computing (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 2010; you can also visit the original URL.
The file type is application/pdf.
In addition, it is shown that most interesting classes of transformations computed by extended top-down tree transducers are not closed under composition. ...
The obtained properties completely explain the Hasse diagram of the induced classes of tree transformations. ...
Among these, we find: • bottom-up tree transducers [28] and attributed tree transducers [15] , • macro tree transducers [5, 13] and modular tree transducers [14] , • tree bimorphisms [2] , and various ...
doi:10.1137/070699160
fatcat:dvmzpcpei5a2rnc3wy2rw2czn4
« Previous
Showing results 1 — 15 out of 414 results