D. Angluin, Inference of Reversible Languages, Journal of the ACM, vol.29, issue.3, pp.741-765, 1982.
DOI : 10.1145/322326.322334

C. Choffrut and J. Karhumäki, Combinatorics of Words, Handbook on Formal Languages, 1997.
DOI : 10.1007/978-3-642-59136-5_6

F. Denis, A. Lemay, and A. Terlutte, Residual Finite State Automata, STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, number 2010 in Lecture Notes in Computer Science, pp.144-157, 2001.
DOI : 10.1007/3-540-44693-1_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.5824

F. Denis, A. Lemay, and A. Terlutte, Some Classes of Regular Languages Identifiable in the Limit from Positive Data, ICGI 2002, number 2484 in Lecture Notes in Artificial Intelligence, pp.63-76, 2002.
DOI : 10.1007/3-540-45790-9_6

F. Denis, A. Lemay, and A. Terlutte, Learning regular languages using RFSAs, Theoretical Computer Science, vol.313, issue.2, pp.267-294, 2004.
DOI : 10.1016/j.tcs.2003.11.008
URL : http://doi.org/10.1016/j.tcs.2003.11.008

H. Fernau, Identification of function distinguishable languages, Lecture Notes in Artificial Intelligence, pp.116-130, 1968.

P. Garcia and E. Vidal, Inference of k-testable languages in the strict sense and application to syntactic pattern recognition, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.12, issue.9, pp.920-925, 1990.
DOI : 10.1109/34.57687

E. M. Gold, Language identification in the limit, Information and Control, vol.10, issue.5, pp.447-474, 1967.
DOI : 10.1016/S0019-9958(67)91165-5

M. Kanazawa, Identification in the limit of categorial grammars, Journal of Logic, Language and Information, vol.5, issue.2, pp.115-155, 1996.
DOI : 10.1007/BF00173697

M. Kanazawa, Learnable Classes of Categorial Grammars. The European Association for Logic, Language and Information, 1998.

M. Latteux, Y. Roos, and A. Terlutte, Minimal NFA and biRFSA Languages, RAIRO - Theoretical Informatics and Applications, vol.43, issue.2, 2005.
DOI : 10.1051/ita:2008022
URL : https://hal.archives-ouvertes.fr/inria-00296658

J. Pin, On reversible automata, Proceedings of Latin American Symposium on Theoretical Informatics (LATIN '92), pp.401-416, 1992.
DOI : 10.1007/BFb0023844
URL : https://hal.archives-ouvertes.fr/hal-00019977

Y. Sakakibara14-]-h, E. Tamm, and . Ukkonen, Efficient learning of context-free grammars from positive structural examples Information and Computation Bideterministic automata and minimal representations of regular languages, 15] T. Yokomori. On polynomial-time learnability in the limit of strictly deterministic automata. Machine Learning, pp.23-60135, 1992.