The following pages link to Alphabetic tree relations (Q1193896):
Displaying 10 items.
- Equational tree transformations (Q551198) (← links)
- Defining syntax-directed translations by tree bimorphisms (Q840769) (← links)
- On two families of forests (Q1323385) (← links)
- Context-free series on trees (Q1854452) (← links)
- A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms (Q3503912) (← links)
- PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS (Q3569270) (← links)
- Decidability of equivalence for a class of non-deterministic tree transducers (Q4365020) (← links)
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)
- Alphabetic and synchronized tree transducers (Q5941078) (← links)
