Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time

We show that the equivalence of deterministic linear top-down tree-to-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not necessarily order-preserving and can be used to express XML and other document transformations. The result is based on a partial normal form that provides a basic characterization of the languages produced by linear tree-to-word transducers.Comment: short version of this paper will be published in the proceedings of the 20th Conference on Developments in Language Theory (DLT 2016), Montreal, Canad

A conditioning principle for Galton-Watson trees

We show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than \eps, converges as \eps\downarrow 0 in law to the regular $\mu$-ary tree, where $\mu$ is the essential minimum of the offspring distribution. This gives an example of entropic repulsion where the limit has no entropy.Comment: This is now superseded by a new paper, arXiv:1204.3080, written jointly with Nina Gantert. The new paper contains much stronger results (e.g. the two-point concentration of the level at which the Galton-Watson tree ceases to be minimal) based on a significantly more delicate analysis, making the present paper redundan