Pages that link to "Item:Q2800413"
From MaRDI portal
The following pages link to A survey on decidable equivalence problems for tree transducers (Q2800413):
Displaying 15 items.
- 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)
- 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)
- Decidability of equivalence for a class of non-deterministic tree transducers (Q4365020) (← links)
- (Q4447233) (← links)
- (Q5090989) (← links)
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)
- (Q5186756) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897794) (← links)
- Streaming ranked-tree-to-string transducers (Q5918275) (← links)
- Definability Results for Top-Down Tree Transducers (Q6169966) (← links)
- Functionality of compositions of top-down tree transducers is decidable (Q6178464) (← links)