Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

88

DLT
2008

108views Theoretical Computer Science» more DLT 2008»

On the Decidability of the Equivalence for k-Valued Transducers

15 years 4 months ago

On the Decidability of the Equivalence for k-Valued Transducers

Download www.infres.enst.fr

Rodrigo de Souza

Real-time Traffic

DLT 2008 | Theoretical Computer Science |

claim paper

Related Content

» Deciding Equivalence of TopDown XML Transformations in Polynomial Time

» The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable

» Conjugacy and Equivalence of Weighted Automata and Functional Transducers

» Properties of Visibly Pushdown Transducers

» Visibly Pushdown Transducers for Approximate Validation of Streaming XML

» The HOM problem is decidable

» Structured Document Transformations Based on XSL

» Query Answering and Containment for Regular Path Queries under Distortions

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	DLT
Authors	Rodrigo de Souza

Comments (0)