Look-Ahead Removal for Top-Down Tree Transducers

Top-down tree transducers are a convenient formalism for describing tree transformations. They can be equipped with regular look-ahead, which allows them to inspect a subtree before processing it. In certain cases, such a look-ahead can be avoided and the transformation can be realized by a transducer without look-ahead. Removing the look-ahead from a transducer, if possible, is technically highly challenging. For a restricted class of transducers with look-ahead, namely those that are total, deterministic, ultralinear, and bounded erasing, we present an algorithm that, for a given transducer from that class, (1) decides whether it is equivalent to a total deterministic transducer without look-ahead, and (2) constructs such a transducer if the answer is positive. For the whole class of total deterministic transducers with look-ahead we present a similar algorithm, which assumes that a so-called difference bound is known for the given transducer. The designer of a transducer can usually also determine a difference bound for it.

[1]  Joost Engelfriet,et al.  Top-down tree transducers with regular look-ahead , 1975, Mathematical systems theory.

[2]  James W. Thatcher,et al.  Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..

[3]  S. Ginsburg,et al.  Finite-Turn Pushdown Automata , 1966 .

[4]  Zoltán Fülöp,et al.  A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead , 2004, Inf. Process. Lett..

[5]  William C. Rounds,et al.  Mappings and grammars on trees , 1970, Mathematical systems theory.

[6]  Joost Engelfriet,et al.  Tree transducers, L systems and two-way machines (Extended Abstract) , 1978, J. Comput. Syst. Sci..

[7]  Kevin Knight,et al.  An Overview of Probabilistic Tree Transducers for Natural Language Processing , 2005, CICLing.

[8]  Frank Drewes.  Grammatical Picture Generation - A Tree-Based Approach , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[9]  Joost Engelfriet,et al.  Decidability of the Finiteness of Ranges of Tree Transductions , 1998, Inf. Comput..

[10]  Emmanuel Filiot,et al.  Visibly Pushdown Transducers with Look-Ahead , 2012, SOFSEM.

[11]  Haruo Hosoya.  Foundations of XML Processing: The Tree-Automata Approach , 2010 .

[12]  Jean-Marc Talbot,et al.  Decision Problems of Tree Transducers with Origin , 2015, ICALP.

[13]  Rajeev Alur,et al.  Streaming Tree Transducers , 2012, ICALP.

[14]  Frank Neven,et al.  Structured Document Transformations Based on XSL , 1999, DBPL.

[15]  Frank Neven,et al.  Frontiers of tractability for typechecking simple XML transformations , 2004, PODS.

[16]  Joost Engelfriet,et al.  Macro Tree Transducers , 1985, J. Comput. Syst. Sci..

[17]  Mark Hopkins,et al.  The Power of Extended Top-Down Tree Transducers , 2009, SIAM J. Comput..

[18]  Arie van Deursen,et al.  Origin Tracking and its Applications , 1996 .

[19]  Joost Engelfriet,et al.  Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations , 1999, Inf. Comput..

[20]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[21]  Christian Choffrut,et al.  Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles , 1977, Theor. Comput. Sci..

[22]  Andreas Maletti,et al.  Tree Transformations and Dependencies , 2011, MOL.

[23]  Zoltán Ésik,et al.  Decidability results concerning tree transducers I , 1980, Acta Cybern..

[24]  Joost Engelfriet,et al.  On Tree Transducers for Partial Functions , 1978, Inf. Process. Lett..

[25]  Joost Engelfriet,et al.  Deciding equivalence of top-down XML transformations in polynomial time , 2009, J. Comput. Syst. Sci..

[26]  Zoltán Ésik,et al.  Decidability results concerning tree transducers II , 1983, Acta Cybern..

[27]  Frank Neven,et al.  Typechecking top-down XML transformations: Fixed input or output schemas , 2006, Inf. Comput..

[28]  Joost Engelfriet,et al.  How to Remove the Look-Ahead of Top-Down Tree Transducers , 2014, Developments in Language Theory.

[29]  Joachim Niehren,et al.  A learning algorithm for top-down XML transformations , 2010, PODS '10.