Attributed Tree Transducers for Partial Functions
Formal Languages and Automata Theory
2024-06-12 v2
Abstract
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.
Keywords
Cite
@article{arxiv.2406.06141,
title = {Attributed Tree Transducers for Partial Functions},
author = {Sebastian Maneth and Martin Vu},
journal= {arXiv preprint arXiv:2406.06141},
year = {2024}
}