A. Dana, Inference of Reversible Languages, JACM, vol.29, issue.3, pp.741-765, 1982.

. Bex-geert-jan, N. Wouter, V. Franck, and . Stijn, Learning deterministic regular expressions pour the inference of schemas from XML data, WWW '08 : Proceeding of the 17th international conference on World Wide Web, pp.825-834, 2008.

G. Pedro and V. Enrique, Inference of k-Testable Languages in the Strict Sense and Application to Syntactic Pattern Recognition, IEEE Trans. Pattern Anal. Mach. Intell, vol.12, issue.9, pp.920-925, 1990.

G. E. Mark, Language identification in the limit, Information and Control, vol.10, issue.5, pp.447-474, 1967.

D. La and . Colin, Characteristic sets pour polynomial grammatical inference, Machine Learning, pp.125-137, 1997.

H. John, E. , U. Jeffrey, and D. , Introduction to Automata Theory, Languages, and Computation, 1979.

M. John, Finite automata and the representation of events, 1957.

N. Anil, Linear automaton transformation, Proc. American Mathematical Society, pp.541-544, 1958.

O. José and G. Pedro, Inferring regular languages in polynomial update time, Pattern Recognition and Image Analysis, pp.49-61, 1992.

P. Leonard, Inductive Inference, DFAs, and Computational Complexity, Proceedings of International Workshop on Analogical and Inductive Inference, pp.18-44, 1989.

Y. Sheng, Handbook of Formal Languages, Regular Languages, pp.41-110, 1997.