Cristina Tīrnăucă. Language learning with correction queries.
Available online here.

Cristina Tīrnăucă, Cătălin Ionuţ Tīrnăucă. Types of trusted information that make DFA identification feasible.
To appear (Proc. of CIAA 2010)

José L. Balcįzar, Cristina Tīrnăucă, Marta E. Zorrilla. Mining educational data for patterns with negation and high confidence boost.
To appear (Proc. of Tamida 2010)

Cristina Tīrnăucă, Satoshi Kobayashi. Necessary and sufficient conditions for learning with correction queries.
In: Theoretical Computer Science (TCS), Vol. 410, Issues 47-49, pp. 5145-5157. Elsevier (November 2009).
PDF BibTex EE

Mihai Ionescu, Cătălin Ionuţ Tīrnăucă, Cristina Tīrnăucă. Dreams and spiking neural P systems.
In: Romanian Journal of Information Science and Technology (RomJist), Vol. 12, No. 2, pp. 209-217. Editura Academiei Romāne, Bucuresti (2009).
PDF BibTex EE

Cristina Tīrnăucă. A note on the relationship between different types of correction queries.
In: A. Clark, Franēois Coste, and Laurent Miclet (Eds.) ICGI ’08. LNAI, Vol. 5278, pp. 213-223. Springer, Berlin (2008).
PDF BibTex EE

Cristina Tīrnăucă, Timo Knuutila. Polynomial time algorithms for learning k-reversible languages and pattern languages with correction queries.
In: M. Hutter, R.A. Servedio, and E. Takimoto (Eds.) ALT ’07. LNAI, Vol. 4754, pp. 264-276. Springer, Berlin (2007).
PDF BibTex EE

Cristina Tīrnăucă, Timo Knuutila. Efficient language learning with correction queries. TUCS Technical Report No. 822 (May 2007).
PDF BibTex EE

Cristina Tīrnăucă, Satoshi Kobayashi. A characterization of the language classes learnable with correction queries.
In: J.-Y. Cai, S.B. Cooper, and H. Zhu (Eds.) TAMC ’07. LNCS, Vol. 4484, pp. 398-407. Springer, Berlin (2007).
PDF BibTex EE

Cătălin Ionuţ Tīrnăucă, Cristina Tīrnăucă. Learning regular tree languages from correction and equivalence queries.
Journal of Automata, Languages and Combinatorics, Vol. 12, No. 4, pp. 501-524 (2007).
PDF BibTex EE

Leonor Becerra-Bonache, Adrian Horia Dediu, Cristina Tīrnăucă. Learning DFA from Correction and Equivalence Queries.
In: Y. Sakakibara, S. Kobayashi, K. Sato, T. Nishino, and E. Tomita (Eds.) ICGI ’06. LNAI, Vol. 4201, pp. 281-292. Springer, Berlin (2006).
PDF BibTex EE

Madalina Barbaiani, Cristina Bibire, Jürgen Dassow, Aidan Delaney, Szilįrd Fazekas, Mihai Ionescu, Guangwu Liu, Atif Lodhi, Benedek Nagy.
The power of programmed grammars with graphs from various classes.
Journal of Applied Mathematics and Computing, Vol. 22, No. 1-2, pp. 21-38  (2006). Website:http://jamc.net
PDF BibTex EE

Leonor Becerra-Bonache, Cristina Bibire, Adrian Horia Dediu. Learning DFA from corrections.
In: Henning Fernau (Ed.) TAGI '05. WSI-2005-14, pp. 1-11. Technical Report, University of Tübingen (2005).
PDF BibTex

Victor Mitrana, Cristina Tīrnăucă. New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries.
Abstract In this note, we show that the number of equivalence queries asked by an algorithm proposed in [6] that learns deterministic finite automata with correction and equivalence queries is at most the injectivity degree of the target language. Further, we propose a tight upper bound for the number of correction queries as a function which depends on the index of the target language, the length of the longest counterexample returned by the teacher and the injectivity degree of the target language.
Submitted.

Cristina Tīrnăucă. A survey of state merging strategies for DFA identification in the limit.
Submitted to URV Press (October 2008).