Pages that link to "Item:Q4146263"
From MaRDI portal
The following pages link to Top-down tree transducers with regular look-ahead (Q4146263):
Displaying 20 items.
- Controlled Term Rewriting (Q3172893) (← links)
- Extended Multi Bottom-Up Tree Transducers (Q3533019) (← links)
- PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS (Q3569270) (← links)
- Tree-Series-to-Tree-Series Transformations (Q3602808) (← links)
- An axiomatic approach to the Korenjak-Hopcroft algorithms (Q3703289) (← links)
- Variants of top-down tree transducers with look-ahead (Q3832064) (← links)
- (Q3929072) (← links)
- Decidability of equivalence for a class of non-deterministic tree transducers (Q4365020) (← links)
- Transductions of dags and trees (Q4742320) (← links)
- Three hierarchies of transducers (Q4747534) (← links)
- A hierarchy of deterministic top-down tree transformations (Q4866680) (← links)
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)
- Streaming ranked-tree-to-string transducers (Q5918275) (← links)
- Alphabetic and synchronized tree transducers (Q5941078) (← links)
- Tree-based generation of languages of fractals (Q5958129) (← links)
- Compositions with Constant Weighted Extended Tree Transducers (Q6072400) (← links)
- Transduction from trees to graphs through folding (Q6145530) (← links)
- Definability Results for Top-Down Tree Transducers (Q6169966) (← links)
- Functionality of compositions of top-down tree transducers is decidable (Q6178464) (← links)
- Attributed tree transducers for partial functions (Q6666800) (← links)
