Marrying words and trees, PODS, pp.233-242, 2007. ,
Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004. ,
DOI : 10.1145/1007352.1007390
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.3757
Squaring transducers: an efficient procedure for deciding functionality and sequentiality, Theoretical Computer Science, vol.292, issue.1, pp.45-63, 2003. ,
DOI : 10.1016/S0304-3975(01)00214-6
Single-valued a-transducers, Journal of Computer and System Sciences, vol.15, issue.3, pp.310-327, 1977. ,
DOI : 10.1016/S0022-0000(77)80033-0
Tree automata techniques and applications, 2007. ,
Macro Tree Translations of Linear Size Increase are MSO Definable, SIAM Journal on Computing, vol.32, issue.4, pp.950-1006, 2003. ,
DOI : 10.1137/S0097539701394511
The equivalence problem for deterministic MSO tree transducers is decidable, Information Processing Letters, vol.100, issue.5, pp.206-212, 2006. ,
DOI : 10.1016/j.ipl.2006.05.015
Macro tree transducers, Journal of Computer and System Sciences, vol.31, issue.1, pp.71-146, 1985. ,
DOI : 10.1016/0022-0000(85)90066-2
On functionality of visibly pushdown transducers, 1002. ,
A note on finite-valued and finitely ambiguous transducers, Mathematical Systems Theory, vol.4, issue.1, p.16, 1983. ,
DOI : 10.1007/BF01744569
Some Decision Problems Concerning Semilinearity and Commutation, Journal of Computer and System Sciences, vol.65, issue.2, p.65, 2002. ,
DOI : 10.1006/jcss.2002.1836
Reversal-Bounded Multicounter Machines and Their Decision Problems, Journal of the ACM, vol.25, issue.1, pp.116-133, 1978. ,
DOI : 10.1145/322047.322058
The complexity of translation membership for macro tree transducers . CoRR, abs, 2009. ,
Attribute grammars for scalable query processing on XML streams, The VLDB Journal, vol.49, issue.1, pp.317-342, 2007. ,
DOI : 10.1007/s00778-005-0169-1
Structured Document Transformations Based on XSL, DBPL, pp.80-98, 1949. ,
DOI : 10.1007/3-540-44543-9_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.2792
Macro forest transducers, Information Processing Letters, vol.89, issue.3, pp.141-149, 2004. ,
DOI : 10.1016/j.ipl.2003.05.001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.686.2441
Testing equivalence of morphisms on context-free languages, ESA, pp.460-470, 1994. ,
DOI : 10.1007/BFb0049431
Visibly Pushdown Transducers, ICALP, pp.386-397, 2008. ,
DOI : 10.1007/978-3-540-70583-3_32
URL : https://hal.archives-ouvertes.fr/inria-00492241
Sur les relations rationnelles, Automata Theory and Formal Languages, pp.209-213, 1975. ,
DOI : 10.1007/3-540-07407-4_22
Single-valuedness of tree transducers is decidable in polynomial time, Theoretical Computer Science, vol.106, issue.1, pp.135-181, 1992. ,
DOI : 10.1016/0304-3975(92)90281-J
Equivalence of finite-valued tree transducers is decidable, Mathematical Systems Theory, vol.4, issue.4, pp.285-346, 1994. ,
DOI : 10.1007/BF01192143
Equivalence of Deterministic Nested Word to Word Transducers, FCT, pp.310-322, 2009. ,
DOI : 10.1007/978-3-642-03409-1_28
URL : https://hal.archives-ouvertes.fr/inria-00423961
On the Complexity of Equational Horn Clauses, CADE, pp.337-352, 2005. ,
DOI : 10.1007/11532231_25