9 search results - page 1 / 2 » On the Decidability of the Equivalence for k-Valued Transduc... |
DLT
2008
13 years 9 months ago
2008
PLANX
2007
13 years 9 months ago
2007
Many useful XML transformations can be formulated through deterministic top-down tree transducers. A canonical form for such transducers is presented which allows to decide equiva...
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
CSR
2006
Springer
13 years 11 months ago
2006
Springer
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automa...