This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We study the equivalence problem of deterministic nested word to word transducers and show it to be suprisingly robust. Modulo polynomal time reductions, it can be identified with...