The following pages link to (Q4611380):
Displaying 14 items.
- Definability results for top-down tree transducers (Q832950) (← links)
- One-way permutations and self-witnessing languages (Q1877694) (← links)
- One-way resynchronizability of word transducers (Q2233399) (← links)
- On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
- Input- or output-unary sweeping transducers are weaker than their 2-way counterparts (Q2969980) (← links)
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES (Q4923281) (← links)
- (Q5089310) (← links)
- (Q5090448) (← links)
- (Q5094153) (← links)
- One-way Definability of Sweeping Transducer. (Q5275366) (← links)
- (Q5376652) (← links)
- (Q5740422) (← links)
- From Two-Way Transducers to Regular Function Expressions (Q5859650) (← links)
- Definability Results for Top-Down Tree Transducers (Q6169966) (← links)