Syntax-directed translations and quasi-alphabetic tree bimorphisms M Steinby, CI Tîrnăucă International Conference on Implementation and Application of Automata, 265-276, 2007 | 8 | 2007 |
Defining syntax-directed translations by tree bimorphisms M Steinby, CI Tîrnăucă Theoretical computer science 410 (37), 3495-3503, 2009 | 7 | 2009 |
Learning regular tree languages from correction and equivalence queries CI Tırnauca, C Tırnauca Journal of Automata, Languages and Combinatorics 12 (4), 501-524, 2007 | 7 | 2007 |
Syntax-directed translations and quasi-alphabetic tree bimorphisms—revisited A Maletti, CI Tîrnăucă Algebraic Informatics: Third International Conference, CAI 2009 …, 2009 | 4 | 2009 |
Dreams and spiking neural P systems M Ionescu, CI Tirnauca, C Tirnauca SCIENCE AND TECHNOLOGY 12 (2), 209-217, 2009 | 3 | 2009 |
Properties of quasi-relabeling tree bimorphisms A Maletti, CI TÎRNĂUCĂ International Journal of Foundations of Computer Science 21 (03), 257-276, 2010 | 2 | 2010 |
Parsing tree adjoining grammars using evolutionary algorithms AH Dediu, CI Tîrnăucă Special Session on Bio-Inspired Multi-Agent Systems 1, 632-639, 2009 | 2 | 2009 |
Syntax-directed translations, tree transformations and bimorphisms CI Tirnauca Universitat Rovira i Virgili, 2016 | | 2016 |
Chapter XIII Evolutionary Algorithms for Parsing Tree Adjoining Grammars AH Dediu, CI Tˆırnauca Bio-Inspired Models for Natural and Formal Languages, 277, 2011 | | 2011 |
Types of trusted information that make DFA identification with correction queries feasible C Tîrnăucă, CI Tîrnăucă International Conference on Implementation and Application of Automata, 272-281, 2010 | | 2010 |
Properties of quasi-alphabetic tree bimorphisms A Maletti, CI Tirnauca arXiv preprint arXiv:0906.2369, 2009 | | 2009 |
Model Syntax-Directed Translations by Tree Transducers. CI Tîrnauca NCMA, 209-220, 2009 | | 2009 |
MODEL SYNTAX-DIRECTED TRANSLATIONS BY TREE TRANSDUCERS CI Tˆırnauca | | |
Tree bimorphisms and their relevance in the theory of translations CI Tîrnăucă | | |