Catalin Ionut Tîrnauca

According to our database, Catalin Ionut Tîrnauca authored at least 10 papers between 2007 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2016

Syntax-directed translations, tree transformations and bimorphisms.

Catalin Ionut Tîrnauca

PhD thesis, 2016

2010

Properties of Quasi-Relabeling Tree Bimorphisms.

Andreas Maletti, Catalin Ionut Tîrnauca

Int. J. Found. Comput. Sci., 2010

Types of Trusted Information That Make DFA Identification with Correction Queries Feasible.

Cristina Tîrnauca, Catalin Ionut Tîrnauca

Proceedings of the Implementation and Application of Automata, 2010

2009

Defining syntax-directed translations by tree bimorphisms.

Magnus Steinby, Catalin Ionut Tîrnauca

Theor. Comput. Sci., 2009

Properties of quasi-alphabetic tree bimorphisms

Andreas Maletti, Catalin Ionut Tîrnauca

CoRR, 2009

Model Syntax-Directed Translations by Tree Transducers.

Catalin Ionut Tîrnauca

Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

Parsing Tree Adjoining Grammars using Evolutionary Algorithms.

Adrian-Horia Dediu, Catalin Ionut Tîrnauca

Proceedings of the ICAART 2009 - Proceedings of the International Conference on Agents and Artificial Intelligence, Porto, Portugal, January 19, 2009

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited.

Andreas Maletti, Catalin Ionut Tîrnauca

Proceedings of the Algebraic Informatics, Third International Conference, 2009

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.

Magnus Steinby, Catalin Ionut Tîrnauca

Proceedings of the Implementation and Application of Automata, 2007