Pages that link to "Item:Q1021574"
From MaRDI portal
The following pages link to Deciding equivalence of top-down XML transformations in polynomial time (Q1021574):
Displaying 10 items.
- Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
- Definability results for top-down tree transducers (Q832950) (← links)
- Look-ahead removal for total deterministic top-down tree transducers (Q906394) (← links)
- Deciding origin equivalence of weakly self-nesting macro tree transducers (Q2680223) (← 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)
- EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS (Q2909099) (← links)
- Largest common prefix of a regular tree language (Q5919000) (← links)
- Definability Results for Top-Down Tree Transducers (Q6169966) (← links)
- Functionality of compositions of top-down tree transducers is decidable (Q6178464) (← links)
