Pages that link to "Item:Q5897794"
From MaRDI portal
The following pages link to FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897794):
Displaying 6 items.
- The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Balancedness of MSO transductions in polynomial time (Q1705700) (← links)
- Determinacy and Rewriting of Top-Down and MSO Tree Transformations (Q2849905) (← links)
- Macro Tree Translations of Linear Size Increase are MSO Definable (Q4429669) (← links)
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)