1,230 Hits in 6.6 sec

Linear Bounded Composition of Tree-Walking Tree Transducers: Linear Size Increase and Complexity [article]

Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth
2019 arXiv   pre-print
For compositions of deterministic transducers it is decidable whether or not the translation is of linear size increase.  ...  Compositions of tree-walking tree transducers form a hierarchy with respect to the number of transducers in the composition.  ...  That does not change the linear-boundedness of the composition: if (τ 1 , τ ′ 2 •τ ′′ 2 ) is linear-bounded and τ ′ 2 ∈ TT rel , then (τ 1 •τ ′ 2 , τ ′′ 2 ) is linear-bounded because τ ′ 2 is size-preserving  ... 
arXiv:1904.09203v3 fatcat:wmhkob2curhnba6hefynpsx6da

Type Checking of Tree Walking Transducers [chapter]

Sebastian Maneth, Sylvia Friese, Helmut Seidl
2012 Modern Applications of Automata Theory  
If the tree walking transducer is additionally equipped with accumulating call-by-value parameters, then the complexity of type checking also depends (exponentially) on the number of such parameters.  ...  One of the useful properties of tree transducers is decidability of type checking: given a transducer and input and output types, it can be checked statically whether the transducer is type correct, i.e  ...  While the height increase of a top-down tree transducer is at most linear, the size increase is at most exponential (viz. the translation of a monadic tree with n nodes into a full binary tree of height  ... 
doi:10.1142/9789814271059_0011 fatcat:qahaifc35jcehlz7inga4f4jfe

XQuery streaming by Forest Transducers

Shizuya Hakuta, Sebastian Maneth, Keisuke Nakano, Hideya Iwasaki
2014 2014 IEEE 30th International Conference on Data Engineering  
our fragment of XQuery supports XPath predicates and let-statements.  ...  We start with an elegant transducer model for which many static analysis problems are well-understood: the Macro Forest Transducer (MFT).  ...  Acknowledgment The authors would like to thank Michael Benedikt and anonymous reviewers for their valuable comments. This work was partially supported by JSPS KAKENHI Grant Number 25730002.  ... 
doi:10.1109/icde.2014.6816714 dblp:conf/icde/HakutaMNI14 fatcat:zanfk55a6ffoth5qzlfveqlssi

Two-Way Visibly Pushdown Automata and Transducers

Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot
2016 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16  
it is a simple computational model, that naturally has a good evaluation complexity; ii) it is expressive: it subsumes nested word-to-word MSO transducers, and the exact expressiveness of MSO transducers  ...  two-way transducers, monadic second-order (MSO) transducers, and deterministic one-way automata equipped with a finite number of registers.  ...  The fact that the inclusions are strict relies on a simple argument based on size increase: on nested words of bounded depth, D2VPT are linear-size increase, while STST and dH2S LA are not.  ... 
doi:10.1145/2933575.2935315 dblp:conf/lics/DartoisFRT16 fatcat:fm2a46sgxrgr7l5iwf6xtb2dna

XML type checking with macro tree transducers

S. Maneth, A. Berlea, T. Perst, H. Seidl
2005 Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '05  
This result is obtained by means of a translation of TL programs into compositions of top-down finite state tree transductions with parameters, also called (stay) macro tree transducers.  ...  This language is based on the "document transformation language" DTL of Maneth and Neven which incorporates full MSO pattern matching, arbitrary navigation in the input tree using also MSO patterns, and  ...  mtt with linear size increase.  ... 
doi:10.1145/1065167.1065203 dblp:conf/pods/ManethBPS05 fatcat:4jrjyg2hj5ezlnaszbsliuyn5m

The Power of Extended Top-Down Tree Transducers

Andreas Maletti, Jonathan Graehl, Mark Hopkins, Kevin Knight
2009 SIAM journal on computing (Print)  
In addition, it is shown that most interesting classes of transformations computed by extended top-down tree transducers are not closed under composition.  ...  Their main properties are identified and their relation to classical top-down tree transducers is exactly characterized.  ...  Instead of linear tdtt R , Baker and Engelfriet investigated linear bottom-up tree transducers [28] .  ... 
doi:10.1137/070699160 fatcat:dvmzpcpei5a2rnc3wy2rw2czn4

Computing the Cost of Typechecking of Composition of Macro Tree Transducers

Keisuke Nakano, Sebastian Maneth
2009 IPSJ Online Transactions  
It is known that the time complexity of typechecking an n-fold composition of macro tree transducers is nonelementary.  ...  In this paper, the impact of such properties on the cost of typechecking is investigated. Reductions in cost are achieved by applying composition and decomposition constructions to tree transducers.  ...  It is well known that the time complexity of typechecking an n-fold composition of macro tree transducers is non-elementary 4), 16) in the size of given tree automata.  ... 
doi:10.2197/ipsjtrans.2.175 fatcat:jyotdksf4fddzaxeht6nmjlmw4

Implicit automata in typed λ-calculi II: streaming transducers vs categorical semantics [article]

Lê Thành Dũng Nguyên, Camille Noûs, Pierre Pradic
2021 arXiv   pre-print
In doing so, we exhibit a connection between a feature of streaming tree transducers and the multiplicative/additive distinction of linear logic.  ...  For the converse, we consider a categorical framework for defining automata and transducers over words, which allows us to relate register updates in SSTs to the semantics of the linear $\lambda$-calculus  ...  Acknowledgment We thank Zeinab Galal for her comments on free (co)completions, Sylvain Salvati for discussions on connections between transducers and simply typed λ-calculi, and Gabriel Scherer for his  ... 
arXiv:2008.01050v3 fatcat:ohkq5kyhenbnfimwa54fnu2cji

XML transformation by tree-walking transducers with invisible pebbles

Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel
2007 Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '07  
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of 'invisible' pebbles (as opposed to the usual 'visible' ones).  ...  The resulting pebble tree transducers can apply arbitrary MSO definable tests to (the observable part of) their configurations, they (still) have a decidable typechecking problem, and they can model the  ...  As claimed by [18] , tl certainly can "describe many real-world XML transformations" (such as, all vi-pft transformations of linear size increase).  ... 
doi:10.1145/1265530.1265540 dblp:conf/pods/EngelfrietHS07 fatcat:lmeteupkabb65h5zpqnzbhvsbi

Pushdown machines for the macro tree transducer

Joost Engelfriet, Heiko Vogler
1986 Theoretical Computer Science  
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..  ...  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).  ...  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

XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles [article]

Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel
2018 arXiv   pre-print
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of "invisible" pebbles (as opposed to the usual "visible" ones).  ...  The resulting pebble tree transducers can apply arbitrary MSO definable tests to (the observable part of) their configurations, they (still) have a decidable typechecking problem, and they can model the  ...  The pebble tree transducer is a tree-walking tree transducer with nested pebbles, i.e., it walks on the input tree, dropping and lifting a bounded number of pebbles that have nested life times, whereas  ... 
arXiv:1809.05730v1 fatcat:pvp5iihrizc27itpae7cdtdxim

The brain as a probabilistic transducer: an evolutionarily plausible network architecture for knowledge representation, computation, and behavior [article]

Joseph Y. Halpern, Arnon Lotem
2021 arXiv   pre-print
They act as probabilistic transducers that use a set of relatively simple rules to determine how activation levels and weights are affected by input, generate output, and affect each other.  ...  decision-making, and the execution of behavior.  ...  Of course, none of them is necessarily in full agreement with our views.  ... 
arXiv:2112.13388v1 fatcat:ncxo5on65zh7dlgoeb5hr7zlni

Automata for XML—A survey

Thomas Schwentick
2007 Journal of computer and system sciences (Print)  
This survey article aims to give an overview of fundamental properties of the different kinds of automata used in this area and to relate them to the four key aspects of XML processing: schemas, navigation  ...  , querying and transformation.  ...  Acknowledgments The author warmly thanks Joost Engelfriet, Christoph Koch, Sebastian Maneth, Wim Martens, Maarten Marx, Frank Neven, and Volker Weber and two anonymous for very many valuable suggestions  ... 
doi:10.1016/j.jcss.2006.10.003 fatcat:rhcckietinczlgoglqehlg2gza

Macro Tree Translations of Linear Size Increase are MSO Definable

Joost Engelfriet, Sebastian Maneth
2003 SIAM journal on computing (Print)  
The first main result is that if a macro tree translation is of linear size increase, i.e., if the size of every output tree is linearly bounded by the size of the corresponding input tree, then the translation  ...  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.  ...  What is the complexity of this problem? In fact, the complexity of deciding the finiteness of ranges of (compositions of) macro tree transducers [11] (cf.  ... 
doi:10.1137/s0097539701394511 fatcat:atspd666bvaffoypzywgckg7wy

Deciding equivalence of top–down XML transformations in polynomial time

Joost Engelfriet, Sebastian Maneth, Helmut Seidl
2009 Journal of computer and system sciences (Print)  
Many useful XML transformations can be expressed by deterministic top-down tree transducers. A normal form is presented for such transducers (extended with the facility to inspect their input trees).  ...  Thus, equivalence of transducers in normal form can be decided in polynomial time. If the transducer is total, the normal form can be obtained in polynomial time as well.  ...  In fact, the bulk of practical translations are of linear size increase, i.e., the size of every output tree is bounded by a constant times the size of the corresponding input tree.  ... 
doi:10.1016/j.jcss.2009.01.001 fatcat:5uliugceine6ngzltcoe2lufny
« Previous Showing results 1 — 15 out of 1,230 results