Sciweavers

Share
DLT
2010

Minimization of Deterministic Bottom-Up Tree Transducers

11 years 5 months ago
Minimization of Deterministic Bottom-Up Tree Transducers
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. Key words: Bottom-up Tree Transducers, Minimization, Normal form
Sylvia Friese, Helmut Seidl, Sebastian Maneth
Added 06 Dec 2010
Updated 06 Dec 2010
Type Conference
Year 2010
Where DLT
Authors Sylvia Friese, Helmut Seidl, Sebastian Maneth
Comments (0)
books