| 2009 | ||
|---|---|---|
| 6 | Carlos Martín-Vide, Cristina Tîrnauca: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008). Inf. Comput. 207(11): 1095 (2009) | |
| 2008 | ||
| 5 | Cristina Tîrnauca: A Note on the Relationship between Different Types of Correction Queries. ICGI 2008: 213-223 | |
| 2007 | ||
| 4 | Cristina Tîrnauca, Timo Knuutila: Polynomial Time Algorithms for Learning k -Reversible Languages and Pattern Languages with Correction Queries. ALT 2007: 272-284 | |
| 3 | Cristina Tîrnauca, Satoshi Kobayashi: A Characterization of the Language Classes Learnable with Correction Queries. TAMC 2007: 398-407 | |
| 2 | Catalin Ionut Tîrnauca, Cristina Tîrnauca: Learning Regular Tree Languages from Correction and Equivalence Queries. Journal of Automata, Languages and Combinatorics 12(4): 501-524 (2007) | |
| 2006 | ||
| 1 | Leonor Becerra-Bonache, Adrian Horia Dediu, Cristina Tîrnauca: Learning DFA from Correction and Equivalence Queries. ICGI 2006: 281-292 | |
| 1 | Leonor Becerra-Bonache | [1] |
| 2 | Adrian Horia Dediu | [1] |
| 3 | Timo Knuutila | [4] |
| 4 | Satoshi Kobayashi | [3] |
| 5 | Carlos Martín-Vide | [6] |
| 6 | Catalin Ionut Tîrnauca | [2] |