The following pages link to (Q3832055):
Displaying 11 items.
- Approximate consistency for transformations on words and trees (Q264563) (← links)
- Modular tree transducers (Q807012) (← links)
- A complete classification of deterministic root-to-frontier tree transformation classes (Q807029) (← links)
- The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations (Q918726) (← links)
- Compositions with superlinear deterministic top-down tree transformations (Q1127541) (← links)
- Linking theorems for tree transducers (Q2628796) (← links)
- The Complexity of Tree Transducer Output Languages (Q3165963) (← links)
- (Q3615224) (← links)
- (Q3655368) (← links)
- Superlinear deterministic top-down tree transducers (Q4895817) (← links)
- (Q4904149) (← links)