1. Segarra, E., Sanchis, E., García, F., Hurtado, L.F., Galiano, I.: Achieving full coverage of automatically learnt finite-state language models. In: Workshop on Finite-State Methods in Natural Language Processing. 10th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2003), Budapest, Hungary, pp. 135–142 (2003)
2. Pla, F.: Etiquetado Léxico y Análisis Sintáctico Superficial basado en Modelos Estadísticos. PhD thesis, Departament de Sistemes Informàtics i Computació, Universitat Politècnica de València (2000)
3. Lang, K.J.: Random dfa’s can be approximately learned from sparse uniform examples. In: COLT 1992: Proceedings of the fifth annual workshop on Computational learning theory, pp. 45–52. ACM Press, New York (1992)
4. Oncina, J.M.: Aprendizaje de lenguajes regulares y funciones subsecuenciales. PhD thesis, Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia (1991)
5. Rulot, H., Vidal, E.: Modelling (sub) string-length based constraints through a grammatical inference method. In: Pattern recognition theory and applications, pp. 451–459. Springer, Heidelberg (1987)