Sciweavers

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

29

FSTTCS
2005
Springer

favoriteEmaildiscussreport

102views Software Engineering» more FSTTCS 2005»

The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable

14 years 4 months ago

The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable

Download www.cse.unsw.edu.au

Joost Engelfriet, Sebastian Maneth

Real-time Traffic

FSTTCS 2005 |

claim paper

Related Content

» Decidability of MSO Theories of Tree Structures

» Deciding Equivalence of TopDown XML Transformations in Polynomial Time

» A Contraction Method to Decide MSO Theories of Deterministic Trees

» XML transformation by treewalking transducers with invisible pebbles

» Deciding XPath containment with MSO

» Relating Tree Series Transducers and Weighted Tree Automata

» The HOM problem is decidable

» Exact XML Type Checking in Polynomial Time

» Structured Document Transformations Based on XSL

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	FSTTCS
Authors	Joost Engelfriet, Sebastian Maneth

Comments (0)