Learning rational stochastic languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4005 LNAI, Issue , 2006, Pages 274-288

  Denis, François ^a   Esposito, Yann ^a   Habrard, Amaury ^a  

^a AIX MARSEILLE UNIV   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORMAL LANGUAGES; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; STOCHASTIC CONTROL SYSTEMS;

MULTIPLICITY AUTOMATA (MA); PROBABILISTIC AUTOMATA (PA); STOCHASTIC LANGUAGES;

LEARNING ALGORITHMS;

EID: 33746063205     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776420_22     Document Type: Conference Paper

References (14)

1. A. Beimel, F. Bergadano, N. H. Bshouty, E. Kushilevitz, and S. Varricchio. On the applications of multiplicity automata in learning. In IEEE Symposium on Foundations of Computer Science, pages 349-358, 1996.
2. A. Beimel, F. Bergadano, N. H. Bshouty, E. Kushilevitz, and S. Varricchio. Learning functions represented as multiplicity automata. Journal of the ACM, 47(3):506-530, 2000.
3. F. Bergadano and S. Varricchio. Learning behaviors of automata from multiplicity and equivalence queries. In Italian Conf. on Algorithms and Complexity, 1994.
4. J. Berstel and C. Reutenauer. Les séries rationnelles et leurs langages. Masson, 1984.
5. R.C. Carrasco and J. Oncina. Learning stochastic regular grammars by means of a state merging method. In ICGI, pages 139-152, Heidelberg, September 1994. Springer-Verlag.
6. F. Denis and Y. Esposito. Learning classes of probabilistic automata. In COLT 2004, number 3120 in LNAI, pages 124-139, 2004.
7. F. Denis and Y. Esposito. Rational stochastic languages. Technical report, LIF - Université de Provence, http://hal.ccsd.cnrs.fr/ccsd- 00019728, 2006.
8. E.M. Gold. Language identification in the limit. Inform. Control, 10:447-474, 1967.
9. G. H. Hardy and E. M. Wright. An introduction to the theory of numbers. Oxford University Press, 1979.
10. G. Lugosi. Principles of Nonparametric Learning, chapter Pattern classification and learning theory, pages 1-56. Springer, 2002.
11. J. Sakarovitch. Éléments de théorie des automates. Éditions Vuibert, 2003.
12. A. Salomaa and M. Soittola. Automata: Theoretic Aspects of Formal Power Series. Springer-Verlag, 1978.
13. F. Thollard, P. Dupont, and C. de la Higuera. Probabilistic DFA inference using Kullback-Leibler divergence and minimality. In Proc. 17th ICML. KAUFM, 975-982.
14. V. N. Vapnik. Statistical Learning Theory. John Wiley, 1998.