Pages that link to "Item:Q1275081"

The following pages link to On the equivalence problem for letter-to-letter top-down tree transducers (Q1275081):

Displaying 11 items.

• Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
• The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
• Decision problems of tree transducers with origin (Q1641005) (← links)
• The complexity of the exponential output size problem for top-down and bottom-up tree transducers (Q1854455) (← links)
• A survey on decidable equivalence problems for tree transducers (Q2800413) (← links)
• Equivalence of Deterministic Nested Word to Word Transducers (Q3183621) (← links)
• Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
• Decidability of equivalence for a class of non-deterministic tree transducers (Q4365020) (← links)
• (Q4514551) (← links)
• The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)
• (Q5186756) (← links)