D. F. Denis, A. Lemay, and A. Terlutte, Learning regular languages using rfsa

D. F. Denis, A. Lemay, and A. Terlutte, Residual Finite State Automata, Fundamenta Informaticae, vol.51, issue.4, pp.339-368, 2002.
DOI : 10.1007/3-540-44693-1_13

D. 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

H. Fernau, Learning tree languages from text On learning unions of pattern languages and tree patterns in the mistake bound model, Proc. 15th Annual Conference on Computational Learning Theory, COLT 2002, pp.153-168237, 2002.

G. E. Gold, Language identification in the limit, GS96. F. Gcseg and M. Steinby. Tree languages Handbook of Formal Languages, pp.447-474, 1967.
DOI : 10.1016/S0019-9958(67)91165-5

L. Liu, C. Pu, and W. Han, XWRAP: an XML-enabled wrapper construction system for Web information sources, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073), pp.611-621, 2000.
DOI : 10.1109/ICDE.2000.839475

M. Murata, D. Lee, and M. Mani, Taxonomy of XML schema languages using formal language theory, Extreme Markup Languages NP97. M. Nivat and A. Podelski. Minimal ascending and descending tree automata. SIAM Journal on Computing, pp.39-4639, 1997.
DOI : 10.1145/1111627.1111631

. Y. Sak90 and . Sakakibara, Learning context-free grammars from structural data in polynomial time Tree automata: an informal survey, Currents in the theory of computing, pp.223-242, 1973.

T. and W. Thomas, Logical aspects in the study of tree languages, Proceedings of the 9th International Colloquium on Trees in Algebra and Programming , CAAP '84, pp.31-5033, 1981.