Pages that link to "Item:Q832950"
From MaRDI portal
The following pages link to Definability results for top-down tree transducers (Q832950):
Displaying 12 items.
- Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670) (← links)
- Deterministic bottom-up tree transducers and ground term rewrite systems (Q1019744) (← links)
- Top-down tree transducers with two-way tree walking look-ahead (Q1185007) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- On the equivalence problem for letter-to-letter top-down tree transducers (Q1275081) (← links)
- Undecidable properties of deterministic top-down tree transducers (Q1341717) (← links)
- Shape preserving top-down tree transducers. (Q1401405) (← links)
- (Q3655368) (← links)
- (Q4414526) (← links)
- Superlinear deterministic top-down tree transducers (Q4895817) (← links)
- Definability Results for Top-Down Tree Transducers (Q6169966) (← links)
- Functionality of compositions of top-down tree transducers is decidable (Q6178464) (← links)