We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of normalizing transformations which, among others, guarantee that non-trivial output is produced as early as possible. For a deterministic bottom-up transducer where every state produces either none or infinitely many outputs, the minimal transducer can be constructed in polynomial time. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Friese, S., Seidl, H., & Maneth, S. (2010). Minimization of deterministic bottom-up tree transducers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6224 LNCS, pp. 185–196). https://doi.org/10.1007/978-3-642-14455-4_18
Mendeley helps you to discover research relevant for your work.