Regular grammatical inference from positive and negative samples by genetic search: The GIG method

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

Volumn 862 LNAI, Issue , 1994, Pages 236-245

  Dupont, Pierre ^a  

^a ORANGE LABS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS;

EXPERIMENTAL PROTOCOLS; FORMAL THEORY; GENETIC OPERATORS; GENETIC SEARCH; GRAMMATICAL INFERENCES; NEGATIVE SAMPLES; REGULAR INFERENCE; SAMPLE SIZES;

COMPUTATIONAL GRAMMARS;

EID: 84997844259     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58473-0_152     Document Type: Conference Paper

References (17)

1. A. Aho and J. Ullman, The Theory of Parsing, Translation and Compiling, Vol. 1: Parsing, Series in Automatic Computation, Prentice-Hall, Englewood, Cliffs, 1972.
2. D. Angluin, Inference of Reversible Languages, Journal of the ACM, Vol. 29, No. 3, pp. 741–765, 1982.
3. P. Dupont, L. Miclet and E. Vidal, What is the search space of the regular inference ?, to be published in the Proc. of the 2nd ICGI, 1994.
4. K.S. Fu and T.L. Booth, Grammatical Inference: Introduction and Survey, IEEE Transactions on SMC, Part 1: Vol. 5, pp. 85–111, Part 2: Vol. 5, pp. 409–423, 1975.
5. E.M. Gold, Language Identification in the Limit, Information and Control, Vol. 10, No. 5, pp. 447–474, 1967.
6. E.M. Gold, Complexity of Automaton Identification from Given Data, Information and Control, Vol. 37, pp. 302–320, 1978.
7. D.E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning, Addison-Wesley, Reading, Massachusetts, 1989.
8. M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Massachusetts, 1978.
9. D.R. Jones and M.A. Beltrano, Solving Partitioning Problems with Genetic Algorithms, Proc. of the 4th ICGA, Morgan Kaufmann Pub., CA, pp. 442–449, 1991.
10. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, Berlin, 1992.
11. L. Miclet, Inférence de Grammaires Régulières, Thèse de Docteur-Ingénieur, E.N.S.T., Paris, France, 1979.
12. L. Miclet, Regular Inference with a Tail-Clustering Method, IEEE Trans. on SMC, Vol. 10, pp. 737–743, 1980.
13. L. Miclet and C. de Gentile, Inférence Grammaticale à partir d'Exemples et de Contre-Exemples: deux Algorithmes Optimaux (BIG et RIG) et une Version Heuristique (BRIG), Actes des JFA-94, Strasbourg, France, pp. F1–F13, 1994.
14. J. Oncina and P. Garcia, Inferring Regular Languages in Polynomial Update Time, Pattern Recognition and Image Analysis, N. Perrez de la Blanca, A. Sanfeliu and E. Vidal (editors), Series in Machine Perception and Artificial Intelligence, Vol. 1, pp. 49–61, World Scientific, 1992.
15. B. Trakhtenbrot and Ya. Barzdin, Finite Automata: Behavior and Synthesis, North Holland Pub. Comp., Amsterdam, 1973.
16. M. Tomita, Dynamic Construction of Finite-Automata From Examples Using Hill-Climbing, Proc. of the 4th Annual Cognitive Science Conference, USA, pp, 105–108, 1982.
17. P. Wyard, Context Free Grammar Induction Using Genetic Algorithms, Proc. of the 4th ICGA, Morgan Kaufmann Pub., CA, pp. 514–518, 1991.