Attributed Tree Transducers for Partial Functions
<|reference_start|>Attributed Tree Transducers for Partial Functions: Attributed tree transducers (atts) have been equipped with regular look-around (i.e., a preprocessing via an attributed relabeling) in order to obtain a more robust class of translations. Here we give further evidence of this robustness: we show that if the class of translations realized by nondeterministic atts with regular look-around is restricted to partial functions, then we obtain exactly the class of translations realized by deterministic atts with regular look-around.<|reference_end|>
@article{maneth2024attributed,
    title={Attributed Tree Transducers for Partial Functions},
    author={Sebastian Maneth and Martin Vu},
    journal={arXiv preprint arXiv:2406.06141},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.06141},
    primaryClass={cs.FL}
}