Noise-tolerant efficient inductive synthesis of regular expressions from good examples

New Generation Computing

Volumn 15, Issue 1, 1997, Pages 105-140

  Brazma, Alvis ^a,b,c,d   Čerans, Karlis ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

^c UNIVERSITY OF LATVIA   (Latvia)

^d UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Algorithmic Learning; Computational Biology; Program Synthesis; Regular Expressions; String Algorithms

Indexed keywords

COMPUTER APPLICATIONS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; LEARNING ALGORITHMS; UNIX;

INDUCTIVE SYNTHESIS; LINEAR TIME METHOD; REGULAR EXPRESSIONS; SYNTHESIS ALGORITHM;

FORMAL LANGUAGES;

EID: 0030787675     PISSN: 02883635     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03037562     Document Type: Article

References (31)

1. Angluin, D., "A Note on the Number of Queries to Identify Regular Languages," Information and Computation, 51, pp. 76-87, 1981.
2. Angluin, D., "Learning Regular Sets from Queries and Counterexamples," Information and Computation, 75, 2, pp. 87-106, 1987.
3. Angluin, D., "Inference of Reversible Languages," J. ACM, 29, pp. 741-765, 1982.
4. Angluin, D. and Laird, P., "Learning from Noisy Examples," Machine Learning, 2, pp. 343-370, 1988.
5. Aho, A., "Pattern Matching in Strings," in Formal Language Theory (R. Book, ed.), Academic Press, 1980.
6. Barzdin, J., "Some Rules of Inductive Inference and Their Use for Program Synthesis," in Proc. of IFIP' 83, North-Holland, pp. 333-338, 1983.
7. Brazma, A., "Inductive Synthesis of Dot Expressions," Lecture Notes in Computer Science, 502, pp. 156-212, 1991.
8. Brazma, A., "Learning a Subclass of Regular Exprssions by Recognizing Periodic Repetitions," in Proc. of the Fourth Scandinavian Conference on Al, IOS Press, the Netherlands, pp. 236-242, 1993.
9. Brazma, A., "Efficient Identification of Regular Expressions from Representative Examples," in Proc. of the Sixth Annual Workshop on Computational Learning Theory COLT 93, ACM press, pp. 236-242, 1993.
10. Brazma, A., "An Algorithm for Finding Approximate Regular Expressions in Biosequences," in open poster section of the Third Annual Conference: Intelligent Systems for Molecular Biology, Robinson College, Cambridge, p. 5, 1995.
11. Brazma, A. and Cerans, K., "Efficient Learning of Regular Expressions from Good Examples," Technical Report, LU-IMCS-TR-CS-94-1, Riga, 1994.
12. Constable, R. L., "The Role of Finite Automata in the Development of Modern Computing Theory," in Proc. of the Kleene Symposium, North-Holland, pp. 61-83, 1980.
13. Feller, W., An Introduction to Probability Theory and Its Applications, third edition, John Wiley & Sons, 1970.
14. Fischetti, V. A., Landau, G. M., Sellers, P. H., and Schmidt, J. P., "Identifying Periodic Occurrences of a Template with Applications to Protein Structure," Proc. Letters, 45, pp. 11-18, 1993.
15. Gold, E. M., "Language Identification in the Limit," Inf. and Control, 10, pp. 447-474, 1967.
16. Freivalds, R., Kinber, E., and Wiehagen, R., "Inductive Inference from Good Examples," Lecture Notes in Artificial Intelligence, 397, pp. 1-18, 1989.
17. Kearns, M. and Valiant, L., "Cryptographic Limitations on Learning Boolean Formulae and Finite Automata," in Proc. of the 1988 Workshop on Computational Learning Theory, Morgan Kaufman, pp. 359-370, 1988.
18. Kearns, M. and Li, M., "Learning in the Presence of Malicious Errors," in Proc. of the 20-th Annual Symposium on Theory of Computing, Chicago, Illinois, ACM Press, 1988.
19. Kinber, E., "Learning a Class of Regular Expressions via Restricted Subset Queries," Lecture Notes in Artificial Intelligence, 642, pp. 232-243, 1992.
20. Konagaya, A., "A Stochastic Approach to Genetic Information," in Proc. of the 3-rd Workshop on Algorithmic Learning Theory ALT'92, JSAI, pp. 25-36, 1992.
21. Li, M. and Vitanyi, P. M. B., "Kolmogorov Complexity and Its Applications," in Handbook of Theoretical Computer Science, Volume A, Elsevier, p. 201, 1990.
22. P in a Free Group," Michigan Math, Journal, 9, pp. 289-298, 1962.
23. Miyano, S., "Learning Theory Toward Genome Informatics," in Proc. of the 4-th Workshop on Algorithmic Learning Theory ALT'93, Lecture Notes in Artificial Intelligence, Springer, pp. 19-36, 1993.
24. Muggleton, S., Inductive Acquisition of Expert Knowledge, Turing Institute Press, 1990.
25. Myers, E. and Miller, W., "Approximate Matching of Regular Expression," Bulletin of Mathematical Biology, 51, 1, pp. 5-37, 1989.
26. Sloan, R., "Type of Noise in Data for Concept Learning," in Proc. of 1988 Workshop on Computational Learning Theory, Morgan Kaufman, pp. 91-96, 1988.
27. Pitt, L., "Inductive Inference, DFAs, and Computational Complexity," Lecture Notes in Artificial Intelligence, 397, pp. 18-44, 1989.
28. Tanida, N. and Yokomori T., "Polynomial-Time Identification of Strictly Regular Languages in the Limit," IEICE Trans. Inf. & Syst. VE75-D, pp. 125-132, 1992.
29. Wagner, R. A. and Seiferas, J. I., "Correcting Counter-Automaton-Recognizable Languages," SIAM Journal on Computing, 7, pp. 357-375, 1978.
30. Wiehagen, R., "From Inductive Inference to Algorithmic Learning," in Proc. Third Workshop on Algorithmic Learning Theory, ALT'92, Sawado, pp. 13-24, 1992.
31. Yamanishi, K., "A Learning Criterion for Stochastic Rules," in Proc. of the 3-rd Workshop on Computational Learning Theory, NY, Morgan Kaufman, pp. 67-81, 1990.