List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Types of trusted information that make DFA identification with correction queries feasible Implementation and Application of Automata | 2011-02-11 | Paper |
| Properties of quasi-relabeling tree bimorphisms International Journal of Foundations of Computer Science | 2010-06-18 | Paper |
| Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited Algebraic Informatics | 2009-11-05 | Paper |
| Defining syntax-directed translations by tree bimorphisms Theoretical Computer Science | 2009-09-14 | Paper |
| Learning regular tree languages from correction and equivalence queries | 2008-07-29 | Paper |
| Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms Implementation and Application of Automata | 2008-06-10 | Paper |
Research outcomes over time
This page was built for person: Cătălin Ionuţ Tîrnăucă
