Incremental regular inference

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

Volumn 1147, Issue , 1996, Pages 222-237

  Dupont, Pierre ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

LEARNING DATA; REGULAR INFERENCE; SEARCH SPACES;

COMPUTATIONAL GRAMMARS;

EID: 84880832127     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0033357     Document Type: Conference Paper

References (12)

1. D. Angluin. On the complexity of minimum inference of regular sets. Information and Control, pages 337-350, 1978.
2. D. Angluin. Inference of reversible languages. Journal of the Association for Computing Machinery, 29(3):741-765, 1982.
3. A. CasteUanos, I. Galiano, and E. Vidal. Application of OSTIA to machine translation tasks. In Grammatical Inference and Applications, ICGI'94, number 862 in Lecture Notes in Artificial Intelligence, pages 93-105. Springer Verlag, 1994.
4. P. Dupont, L. Miclet, and E. Vidal. What is the search space of the regular inference ? In Grammatical Inference and Applications, ICGI'94, number 862 in Lecture Notes in Artificial Intelligence, pages 25-37. Springer Verlag, 1994.
5. P. Dupont. Utilization et Apprentissage de Modèles de Langage pour la Reconnaissance de la Parole Continue. Thèse de Doctorat, Ecole Nationale Supérieure des Télécommunications, Paris, France, 1996.
6. K.S. Fu and T.L. Booth. Grammatical inference: Introduction and survey, part 1. IEEE Transactions on Systems, Man and Cybernetics, 5:85-111, 1975.
7. J.A. Feldman, G. Lakoff, A. Stoleke, and S.H. Weber. Miniature language acquisition: A touchstone for cognitive science. Technical Report TR-90- 009, International Computer Science Institute, Berkeley, California, 1990.
8. E.M. Gold. Language identification in the limit. Information and Control, 10(5):447-474, 1967.
9. E.M. Gold. Complexity of automaton identification from given data. Information and Control, 37:302-320, 1978.
10. K.J. Lang. Random DFA's can be approximately learned from sparse uniform examples. In 5th A CM workshop on Computational Learning Theory, pages 45-52, 1992.
11. J. Oncina and P. García. Inferring regular languages in polynomial update time. In N. Pérez de la Blanca, A. Sanfeliu, and E.Vidal, editors, Pattern Recognition and Image Analysis, volume 1 of Series in Machine Perception and Artificial Intelligence, pages 49-61. World Scientific, 1992.
12. A. Stolcke. Bayesian Learning of Probabilistic Language Models. Ph.D. dissertation, University of California, 1994.