Pages that link to "Item:Q685348"
From MaRDI portal
The following pages link to Single-valuedness of tree transducers is decidable in polynomial time (Q685348):
Displayed 8 items.
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- On the equivalence problem for letter-to-letter top-down tree transducers (Q1275081) (← links)
- Finite tree automata with cost functions (Q1325851) (← links)
- A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
- EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS (Q2909099) (← links)
- Automatic structures of bounded degree revisited (Q3107359) (← links)
- Bounded Delay and Concurrency for Earliest Query Answering (Q3618594) (← links)
- Equivalence of finite-valued tree transducers is decidable (Q4301635) (← links)