Paper Info
Title
Definability Results for Top-Down Tree Transducers.
Abstract
We prove that for a given deterministic top-down transducer with look-ahead it is decidable whether or not its translation is definable (1)~by a linear top-down tree transducer or (2)~by a tree homomorphism. We present algorithms that construct equivalent such transducers if they exist.
Year
DOI
Venue
2021
10.1007/978-3-030-81508-0_24
DLT
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Sebastian Maneth1145.93
Helmut Seidl21468103.61
Martin Vu301.69