Pages that link to "Item:Q845868"

The following pages link to The equivalence problem for deterministic MSO tree transducers is decidable (Q845868):

Displaying 16 items.

• Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
• A faithful representation of non-associative Lambek grammars in abstract categorial grammars (Q972436) (← links)
• Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
• Decision problems of tree transducers with origin (Q1641005) (← links)
• Balancedness of MSO transductions in polynomial time (Q1705700) (← links)
• A survey on decidable equivalence problems for tree transducers (Q2800413) (← links)
• Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time (Q2817401) (← links)
• Determinacy and Rewriting of Top-Down and MSO Tree Transformations (Q2849905) (← links)
• Earliest normal form and minimization for bottom-up tree transducers (Q2909099) (← links)
• Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
• Macro Tree Translations of Linear Size Increase are MSO Definable (Q4429669) (← links)
• Copyful Streaming String Transducers (Q4989167) (← links)
• (Q5089205) (← links)
• The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897794) (← links)
• Streaming ranked-tree-to-string transducers (Q5918275) (← links)