Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
Formal Languages and Automata Theory
2024-04-16 v3
Abstract
We prove that for a given partial functional attributed tree transducer with monadic output, it is decidable whether or not an equivalent top-down transducer (with or without look-ahead) exists. We present a procedure that constructs an equivalent top-down transducer (with or without look-ahead) if it exists.
Keywords
Cite
@article{arxiv.2306.04326,
title = {Deciding whether an Attributed Translation can be realized by a Top-Down Transducer},
author = {Sebastian Maneth and Martin Vu},
journal= {arXiv preprint arXiv:2306.04326},
year = {2024}
}