P. Dupont, L. Alon, A. K. Dewdey, and T. J. Ott, Efficient simulation of finite automata by neural nets, Journal of the Association for Computing Machinery, vol.38, issue.2, pp.495-514, 1991.

]. D. Ang78 and . Angluin, On the complexity of minimum inference of regular sets, Information and Control, vol.39, pp.337-350, 1978.

]. D. Ang82 and . Angluin, Inference of reversible languages, Journal of the Association for Computing Machinery, vol.29, issue.3, pp.741-765, 1982.

]. D. Ang87 and . Angluin, Queries and concept learning, Machine Learning, pp.319-342, 1987.

]. D. Ang88 and . Angluin, Identifying languages from stochastic examples, 1988.

C. [. Angluin and . Smith, Inductive Inference: Theory and Methods, ACM Computing Surveys, vol.15, issue.3, pp.237-269, 1983.
DOI : 10.1145/356914.356918

J. [. Aho and . Ullman, The Theory of Parsing, Translation and Compiling, vol.1, 1972.

]. J. Bar74 and . Barzdin, Two theorems on the limiting synthesis of functions, Latv. Gos. Univ, vol.210, 1974.

J. [. Biermann and . Feldman, A SURVEY OF RESULTS IN GRAMMATICAL INFERENCE, Frontiers of Pattern Recognition, pp.31-54, 1972.
DOI : 10.1016/B978-0-12-737140-5.50007-5

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, 1990.

C. [. Case and . Smith, Comparison of identification criteria for machine inductive inference, Theoretical Computer Science, vol.25, issue.2, pp.193-220, 1983.
DOI : 10.1016/0304-3975(83)90061-0

A. Cleeremans, D. Servan-schreiber, and J. Mcclelland, Finite State Automata and Simple Recurrent Networks, Neural Computation, vol.1, issue.3, pp.372-381, 1989.
DOI : 10.1038/323533a0

D. [. David and . Barton, Combinatorial Chance., Economica, vol.29, issue.115, 1962.
DOI : 10.2307/2551259

P. Dupont, L. Miclet, and E. Vidal, What is the search space of the regular inference?, Grammatical Inference and Applications, ICGI'94, number 862 in Lecture Notes in Artificial Intelligence, pp.25-37, 1994.
DOI : 10.1007/3-540-58473-0_134

I. Dupont, Regular grammatical inference from positive and negative samples by genetic search: the GIG method, Grammatical Inference and Applications, ICGI'94, number 862 in Lecture Notes in Artificial Intelligence, pp.236-245, 1994.
DOI : 10.1007/3-540-58473-0_152

P. Dupont, Incremental regular inference, Grammatical Inference : Learning Syntax from Sentences, ICGI'96, number 1147 in Lecture Notes in Artificial Intelligence, pp.222-237, 1996.
DOI : 10.1007/BFb0033357

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.3539

P. Dupont, Utilisation 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, 1996.

]. J. Elm88 and . Elman, Finding structure in time, 1988.

]. K. Fb75a, T. L. Fu, and . Booth, Grammatical inference: Introduction and survey, part 1, IEEE Transactions on Systems, Man and Cybernetics, vol.5, pp.85-111, 1975.

]. K. Fb75b, T. L. Fu, and . Booth, Grammatical inference: Introduction and survey, part 2, IEEE Transactions on Systems, Man and Cybernetics, vol.5, pp.409-423, 1975.

]. G. For73 and . Forney, The Viterbi algorithm, IEEE Proceedings, vol.3, pp.268-278, 1973.

A. [. Gross and . Lentin, Notion sur les Grammaires Formelles, 1970.

A. L. Gorin, S. E. Levinson, A. N. Gertner, and E. Goldman, Adaptive acquisition of language, Computer Speech & Language, vol.5, issue.2, pp.101-132, 1991.
DOI : 10.1016/0885-2308(91)90020-Q

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

]. E. Gol78 and . Gold, Complexity of automaton identification from given data, Information and Control, vol.37, pp.302-320, 1978.

]. J. Gre94 and . Gregor, Data-driven inductive inference of finite-state automata, International Journal of Pattern Recognition and Artificial Intelligence, vol.8, issue.1, pp.305-322, 1994.

C. L. Giles, G. Z. Sun, H. H. Chen, Y. C. Lee, and D. Chen, High order recurrent networks and grammatical inference, Advances in Neural Information Processing System, pp.380-387, 1990.
DOI : 10.1109/ijcnn.1991.155350

P. García, E. Segarra, E. Vidal, and I. Galiano, ON THE USE OF THE MORPHIC GENERATOR GRAMMATICAL INFERENCE (MGGI) METHODOLOGY IN AUTOMATIC SPEECH RECOGNITION, International Journal of Pattern Recognition and Artificial Intelligence, vol.04, issue.04, pp.667-685, 1990.
DOI : 10.1142/S021800149000037X

M. [. Gonzalez and . Thomason, Syntacic Pattern Recognition, An Introduction, 1978.

E. [. García and . Vidal, Inference of k-testable languages in the strict sense and application to syntactic pattern recognition, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.12, issue.9, pp.920-925, 1990.
DOI : 10.1109/34.57687

P. García, E. Vidal, and F. Casacuberta, Local languages, the Successor method, and a step towards a general methodology for the inference of regular grammars, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.9, issue.6, pp.841-845, 1987.

]. J. Hor69 and . Horning, A Study of Grammatical Inference, 1969.

R. [. Hartmanis and . Stearns, Algebraic Structure Theory of Sequential Machines

A. N. Jain, A. Waibel, and D. S. Touredsky, PARSEC: a structured connectionist parsing system for spoken language, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, pp.205-208, 1992.
DOI : 10.1109/ICASSP.1992.225936

L. [. Kearns and . Valiant, Cryptographic limitations on learning boolean formulae and finite automata, 21st ACM Symposium on Theory of Computing, pp.433-444, 1989.
DOI : 10.1007/3-540-56483-7_21

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.5438

]. K. Lan92 and . Lang, Random DFA's can be approximately learned from sparse uniform examples, 5th ACM workshop on Computational Learning Theory, pp.45-52, 1992.

L. Miclet and C. De-gentile, Inférence grammaticale à partir d'exemples et de contreexemples : deux algorithmes optimaux (big et rig) et une version heuristique (brig)

L. Miclet, P. Dupont, and S. Vial, Inférence grammaticale régulière : Méthodes semiitératives et mesure de performance, Journées Acquisition, pp.103-116, 1995.

]. L. Mic79 and . Miclet, Inférence de Grammaires Régulières, Thèse de Doctorat, Ecole Nationale Supérieure des Télécommunications, 1979.

]. L. Mic80 and . Miclet, Regular inference with a tail-clustering method, IEEE Transactions on Systems , Man and Cybernetics, vol.10, pp.737-743, 1980.

]. L. Mic90 and . Miclet, Grammatical inference, Syntactic and Structural Pattern Recognition: Theory and Applications of Series in Computer Science, pp.237-290, 1990.

]. M. Min54 and . Minsky, Neural Nets and the Brain Model problem, 1954.

]. M. Min67 and . Minsky, Computation: Finite and Infinite Machines, 1967.

]. T. Mit78 and . Mitchell, Version Spaces: an approach to Concept Learning, 1978.

W. [. Mccullough and . Pitts, A logical calculus of the ideas immanent in nervous activity, The Bulletin of Mathematical Biophysics, vol.5, issue.4, pp.115-133, 1943.
DOI : 10.1007/BF02478259

I. Muggleton, Induction of regular languages from positive examples, 1984.

]. B. Nat91 and . Natarajan, Machine Learning : A Theoretical Approach, 1991.

]. J. Nic93 and . Nicolas, L'espace des versions, Ecole sur l'Apprentissage automatique, pp.19-32, 1993.

K. [. Nakamura and . Shikano, A study of English word category prediction based on neural networks, International Conference on Acoustic, Speech and Signal Processing, pp.731-734, 1989.
DOI : 10.1121/1.2026400

P. [. Oncina and . García, INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME, of Series in Machine Perception and Artificial Intelligence, pp.49-61, 1992.
DOI : 10.1142/9789812797902_0004

]. L. Pit89 and . Pitt, Inductive inference, dfa's, and computational complexity, Analogical and Inductive Inference, number 397 in Lecture Notes in Artificial Intelligence, pp.18-44, 1989.

]. J. Pol90, . Pollackpw89-]-l, M. Pitt, and . Warmuth, Recursive distribute representation The minimum consistent dfa problem cannot be approximated within any polynomial, 21st ACM Symposium on Theory of Computing, pp.77-105, 1989.

]. H. Rul92 and . Rulot, ECGI : Un Algoritmo de Inferencia Gramatical Mediante Corrección de Errores, 1992.

F. [. Richetin and . Vernadat, Efficient regular grammatical inference for pattern recognition, Pattern Recognition, vol.17, issue.2, pp.245-250, 1984.
DOI : 10.1016/0031-3203(84)90063-3

E. [. Rulot and . Vidal, An Efficient Algorithm for the Inference of Circuit-Free Automata, Advances in Structural and Syntactic Pattern Recognition, pp.173-184, 1988.
DOI : 10.1007/978-3-642-83462-2_11

]. E. Seg93 and . Segarra, Una Aproximacion Inductiva a la Comprension del Discurso Continuo, 1993.

M. [. Smith and . Miller, Learning regular grammars on connection architectures, International Conference on Acoustics, Speech, and Signal Processing, pp.2501-2504, 1989.
DOI : 10.1109/ICASSP.1989.266975

Y. [. Trakhtenbrot and . Barzdin, Finite Automata: Behavior and Synthesis, 1973.

]. L. Val84 and . Valiant, A theory of the learnable, Communications of the Association for Computing Machinery, vol.27, issue.11, pp.1134-1142, 1984.

E. Vidal, P. Casacuberta, and P. García, Grammatical inference and applications to automatic speech recognition, 1993.
DOI : 10.1007/978-3-642-57745-1_27

R. M. Wharton, Approximate language identification, Information and Control, vol.26, issue.3, pp.236-255, 1974.
DOI : 10.1016/S0019-9958(74)91369-2

URL : http://doi.org/10.1016/s0019-9958(74)91369-2

R. M. Wharton, Grammar enumeration and inference, Information and Control, vol.33, issue.3, pp.253-272, 1977.
DOI : 10.1016/S0019-9958(77)80005-3

URL : http://doi.org/10.1016/s0019-9958(77)80005-3

I. Unité-de-recherche, . Lorraine, V. Technopôle-de-nancy-brabois, I. Unité-de-recherche, and . Rennes, Campus scientifique, 615 rue du Jardin Botanique Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, p.78153, 2004.