Regulated Tree Automata. - Henning Fernau; Martin Vu (DCFS, 2019)

Insertion-Deletion with Substitutions II. - Martin Vu; Henning Fernau (DCFS, 2020)

Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. - Martin Vu; Henning Fernau (Algorithms, 2021)

How to Decide Functionality of Compositions of Top-Down Tree Transducers. - Sebastian Maneth; Helmut Seidl; Martin Vu (CAI, 2022)

Insertion-deletion systems with substitutions I. - Martin Vu; Henning Fernau (Comput., 2022)

Deciding Whether an Attributed Translation Can Be Realized by a Top-Down Transducer. - Sebastian Maneth; Martin Vu (CIAA, 2023)

Definability Results for Top-Down Tree Transducers. - Sebastian Maneth; Helmut Seidl; Martin Vu (Int. J. Found. Comput. Sci., 2023)

Insertion-Deletion with Substitutions II: About the Role of One-Sided Context. - Martin Vu; Henning Fernau (J. Autom. Lang. Comb., 2023)

Attributed Tree Transducers for Partial Functions. - Sebastian Maneth; Martin Vu (CIAA, 2024)

Functionality of compositions of top-down tree transducers is decidable. - Sebastian Maneth; Helmut Seidl; Martin Vu (Inf. Comput., 2024)