Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms. - Magnus Steinby; Catalin Ionut Tîrnauca (CIAA, 2007)

Learning Regular Tree Languages from Correction and Equivalence Queries. - Catalin Ionut Tîrnauca; Cristina Tîrnauca (J. Autom. Lang. Comb., 2007)

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited. - Andreas Maletti; Catalin Ionut Tîrnauca (CAI, 2009)

Parsing Tree Adjoining Grammars using Evolutionary Algorithms. - Adrian-Horia Dediu; Catalin Ionut Tîrnauca (ICAART, 2009)

Model Syntax-Directed Translations by Tree Transducers. - Catalin Ionut Tîrnauca (NCMA, 2009)

Properties of quasi-alphabetic tree bimorphisms - Andreas Maletti; Catalin Ionut Tîrnauca (CoRR, 2009)

Defining syntax-directed translations by tree bimorphisms. - Magnus Steinby; Catalin Ionut Tîrnauca (Theor. Comput. Sci., 2009)

Types of Trusted Information That Make DFA Identification with Correction Queries Feasible. - Cristina Tîrnauca; Catalin Ionut Tîrnauca (CIAA, 2010)

Properties of Quasi-Relabeling Tree Bimorphisms. - Andreas Maletti; Catalin Ionut Tîrnauca (Int. J. Found. Comput. Sci., 2010)

Syntax-directed translations, tree transformations and bimorphisms. - Catalin Ionut Tîrnauca (2016)