Filters








276 Hits in 5.0 sec

The Complexity of Translation Membership for Macro Tree Transducers [article]

Kazuhiro Inaba, Sebastian Maneth
2009 arXiv   pre-print
Macro tree transducers (mtts) are a useful formal model for XML query and transformation languages.  ...  In this paper one of the fundamental decision problems on translations, namely the "translation membership problem" is studied for mtts.  ...  Acknowledgments This work was partly supported by Japan Society for the Promotion of Science.  ... 
arXiv:0910.2315v1 fatcat:kj4456duwzhnlpqz3mtx6sqdqu

The Complexity of Tree Transducer Output Languages

Kazuhiro Inaba, Sebastian Maneth, Marc Herbstritt
2008 Foundations of Software Technology and Theoretical Computer Science  
Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in NSPACE(n) and hence are context-sensitive, and the class is NP-complete.  ...  Introduction Macro tree transducers (mtts) [12, 14] are a finite-state machine model of tree-to-tree translations.  ...  Two previous works on the same membership problem for restricted classes of macro tree transducers -for total deterministic mtts [17] and for nondeterministic mtts without parameters (top-down tree transducers  ... 
doi:10.4230/lipics.fsttcs.2008.1757 dblp:conf/fsttcs/InabaM08 fatcat:zvz3suwthfhqjnhsy3jgwyaucm

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

Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth
2019 arXiv   pre-print
The membership problem for the composition of a nondeterministic and a deterministic tree-walking tree translation (for a nondeterministic IO macro tree translation) is log-space reducible to a context-free  ...  language, whereas the membership problem for the composition of a deterministic and a nondeterministic tree-walking tree translation (for a nondeterministic OI macro tree translation) is possibly NP-complete  ...  We are grateful to the reviewers for their constructive comments.  ... 
arXiv:1904.09203v3 fatcat:wmhkob2curhnba6hefynpsx6da

Macro tree transducers

Joost Engelfriet, Heiko Vogler
1985 Journal of computer and system sciences (Print)  
Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled.  ...  In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical topics like composition, decomposition, domains, and ranges of the induced translation  ...  -What is the complexity of deciding the membership problem and the general membership problem for the output tree languages of macro tree transducers (viewed as expressions over the alphabet with two additional  ... 
doi:10.1016/0022-0000(85)90066-2 fatcat:gty4pogykvdw7fowvgwydb4l2a

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192)

Sebastian Maneth, Helmut Seidl, Marc Herbstritt
2013 Dagstuhl Reports  
Tree transducers are a classical formalism in computer science, dating back to the early days of compilers and syntax-directed translation.  ...  The aim of this Dagstuhl Seminar was to bring together researchers from various research areas related to the theory and application of tree transducers.  ...  time implementation model for MSO tree translations: the streaming tree transducer by Loris d'Antoni.  ... 
doi:10.4230/dagrep.3.5.1 dblp:journals/dagstuhl-reports/ManethS13 fatcat:xxotqpzgnzc3zdlkk4zxsdot5i

Pushdown machines for the macro tree transducer

Joost Engelfriet, Heiko Vogler
1986 Theoretical Computer Science  
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).  ...  Because of the relevance for semantics of programming languages, we stress (besides the nondeterministic case) the study of machines for the total deterministic macro tree(-to-string) transducer, which  ...  Let AG denote the class of tree translations realized by attribute grammars.  ... 
doi:10.1016/0304-3975(86)90052-6 fatcat:fm62zkw4l5ewtcuddtxs2fvxt4

Automata for XML—A survey

Thomas Schwentick
2007 Journal of computer and system sciences (Print)  
Automata play an important role for the theoretical foundations of XML data management, but also in tools for various XML processing tasks.  ...  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  ...  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)  
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.  ...  We thank the referees for their constructive comments.  ... 
doi:10.1137/s0097539701394511 fatcat:atspd666bvaffoypzywgckg7wy

Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable

Helmut Seidl, Sebastian Maneth, Gregor Kemper
2018 Journal of the ACM  
We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory.  ...  This allows us to construct two semi-algorithms, one searching for a proof of equivalence, one for a witness of non-equivalence.  ...  We thank the anonymous referees for careful reading and for many helpful comments.  ... 
doi:10.1145/3182653 fatcat:ayyyao4j4ncfflbq6lboybjbru

Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable

Helmut Seidl, Sebastian Maneth, Gregor Kemper
2015 2015 IEEE 56th Annual Symposium on Foundations of Computer Science  
We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory.  ...  This allows us to construct two semi-algorithms, one searching for a proof of equivalence, one for a witness of non-equivalence.  ...  We thank the anonymous referees for careful reading and for many helpful comments.  ... 
doi:10.1109/focs.2015.62 dblp:conf/focs/SeidlMK15 fatcat:grhs3xh6qfazhfyp5hwl64gt7a

Visibly pushdown transducers

Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
2018 Journal of computer and system sciences (Print)  
As for VPA, the behavior of the stack is synchronized with the types of input symbols: on reading a call symbol, exactly one stack symbol is pushed onto the stack; on reading a return symbol, exactly one  ...  Therefore VPT define transformations from nested words to words and can be seen as a subclass of pushdown transducers.  ...  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

An operational and denotational approach to non-context-freeness

Hans-Peter Kolb, Jens Michaelis, Uwe Mönnich, Frank Morawietz
2003 Theoretical Computer Science  
The logical description is speciÿed in terms of binary monadic second-order (MSO) formulas and the operational description is achieved by means of a linear and non-deleting macro tree transducer.  ...  Besides giving a grammatical presentation for the regular tree language we shall also specify an implementation in the form of a ÿnite-state (tree) automaton to emphasize the e ectivity of our approach  ...  The authors wish to thank Kai-Uwe K uhnberger, Tom Cornell and Jim Rogers for helpful comments.  ... 
doi:10.1016/s0304-3975(01)00348-6 fatcat:z44yb7ac7ze4bjf3t32ldtk3zm

An Infinite Automaton Characterization of Double Exponential Time [chapter]

Salvatore La Torre, P. Madhusudan, Gennaro Parlato
2008 Lecture Notes in Computer Science  
In this sense, the result captures the complexity class qualitatively, by restricting the power of rewriting. ⋆ The first and third authors were partially supported by the MIUR grants ex-60% 2006 and 2007  ...  The salient aspect of this characterization is that the automata have no ostensible limits on time nor space, and neither direction of containment with respect to 2ETIME is obvious.  ...  The membership problem for BPTAs is decidable in 2ETIME.  ... 
doi:10.1007/978-3-540-87531-4_5 fatcat:mvw4xtq7zvf6hlxryqdclul73m

Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable [article]

Helmut Seidl, Sebastian Maneth, Gregor Kemper
2017 arXiv   pre-print
We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory.  ...  This allows us to construct two semi-algorithms, one searching for a proof of equivalence, one for a witness of non-equivalence.  ...  Deterministic macro tree-to-string transducers (yDMT transducers) combine yDT transducers with the nesting present in macro grammars.  ... 
arXiv:1503.09163v2 fatcat:b7xeqhx3q5ednpmskwubfvsfoe

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.  ...  Such transducers additionally allow to test input trees for membership in arbitrary regular tree languages.  ... 
doi:10.1016/j.jcss.2009.01.001 fatcat:5uliugceine6ngzltcoe2lufny
« Previous Showing results 1 — 15 out of 276 results