The following pages link to (Q3906457):
Displayed 13 items.
- Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
- Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
- Definability results for top-down tree transducers (Q832950) (← links)
- The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
- Look-ahead removal for total deterministic top-down tree transducers (Q906394) (← links)
- Deterministic bottom-up tree transducers and ground term rewrite systems (Q1019744) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- On the equivalence problem for letter-to-letter top-down tree transducers (Q1275081) (← links)
- Decision problems of tree transducers with origin (Q1641005) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
- Equivalence of finite-valued tree transducers is decidable (Q4301635) (← links)
- Decidability of equivalence for a class of non-deterministic tree transducers (Q4365020) (← links)