Inference of regular languages using state merging algorithms with search

Pattern Recognition

Volumn 38, Issue 9, 2005, Pages 1457-1467

  Bugalho, Miguel ^a   Oliveira, Arlindo L ^a  

^a INESC ID   (Portugal)

Author keywords

DFA inference; Grammatical inference; Inference of regular grammars

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GRAMMARS; COMPUTER SIMULATION; FINITE AUTOMATA; PROBLEM SOLVING;

DETERMINISTIC FINITE AUTOMATON (DFA) INFERENCE; EVIDENCE DRIVEN STATE MERGING (EDSM) ALGORITHM; GRAMMATICAL INFERENCE; INFERENCE OF REGULAR GRAMMARS;

FORMAL LANGUAGES;

EID: 19944414336     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2004.03.027     Document Type: Article

References (32)

1. A. Stolcke, Bayesian learning of probabilistic language models, Ph.D. Thesis, UC Berkeley, Berkeley, CA, 1994.
2. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth Occam's razor Inform. Process. Lett. 24 1987 377 380
3. A.L. Oliveira, Inductive learning by selection of minimal complexity representations, Ph.D. Thesis, UC Berkeley, December 1994.
4. Also available as UCB/ERL Technical report M94/97.
5. K.J. Lang, B.A. Pearlmutter, R. Price, Results of the Abbadingo One DFA learning competition and a new evidence driven state merging algorithm, in: Fourth International Colloquium on Grammatical Inference (ICGI-98), Lecture Notes in Computer Science, vol. 1433, 1998, pp. 1-12.
6. E.M. Gold Complexity of automaton identification from given data Inform. Control 37 1978 302 320
7. L. Pitt, and M. Warmuth The minimum consistent DFA problem cannot be approximated within any polynomial J. Assoc. Comput. Mach. 40 1 1993 95 142
8. S. Porat, and J.A. Feldman Learning automata from ordered examples Proceedings of the First Annual Workshop on Computational Learning Theory 1988 Morgan Kaufmann San Mateo, CA 386 396
9. D. Angluin On the complexity of minimum inference of regular sets Inform. Control 39 3 1978 337 350
10. D. Angluin Learning regular sets from queries and counterexamples Inform. Comput. 75 2 1987 87 106
11. E.M. Gold System identification via state characterization Automatica 8 1972 621 636
12. R.E. Schapire The Design and Analysis of Efficient Learning Algorithms 1992 MIT Press Cambridge, MA
13. P. Adriaans, H. Fernau, M. van Zaanen (Eds.), Grammatical Inference: Algorithms and Applications, Proceedings of the Sixth International Colloquium on Grammatical Inference (ICGI-02), Lecture Notes in Computer Science, vol. 2484, Springer, Berlin, September 2002.
14. V. Honavar, G. Slutzki (Eds.), Grammatical Inference: Proceedings of the Fourth International Colloquium on Grammatical Inference (ICGI-98), Lecture Notes in Computer Science, vol. 1433, Springer, Berlin, September 1998.
15. A.L. Oliveira (Ed.), Grammatical Inference: Algorithms and Applications, Proceedings of the Fifth International Colloquium on Grammatical Inference (ICGI-00), Lecture Notes in Computer Science, vol. 1891, Springer, Berlin, September 2000.
16. B.A. Trakhtenbrot, and Y.M. Barzdin Finite Automata 1973 North-Holland Amsterdam
17. J. Oncina, and P. Garcia Inferring regular languages in polynomial update time Pattern Recognition and Image Analysis 1992 World Scientific Singapore 49 61
18. K.J. Lang Random DFA's can be approximately learned from sparse uniform examples Proceedings of the Fifth Annual Workshop on Computational Learning Theory 1992 ACM Press New York, NY 45 52
19. A.W. Biermann, and R. Krishnaswamy Constructing programs from example computations IEEE Trans. Software Eng. SE-2 1976 141 153
20. A.W. Biermann, and F.E. Petry Speeding up the synthesis of programs from traces IEEE Trans. Comput. C-24 1975 122 136
21. A.L. Oliveira, S. Edwards, Limits of exact algorithms for inference of minimum size finite state machines, in: Proceedings of the Seventh Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, vol. 1160, Sydney, Australia, Springer, Berlin, October 1996, pp. 59-66.
22. A.L. Oliveira, S. Edwards, Inference of state machines from examples of behavior, Technical Report, UCB/ERL M95/12, Berkeley, CA, February 1995.
23. K.J. Lang Faster algorithms for finding minimal consistent DFAs 1999 Private communication
24. A.L. Oliveira, and J.P.M. Silva Efficient algorithms for the inference of minimum size DFAs Mach. Learning 44 1/2 2001 93 119
25. F. Coste, J. Nicolas, Regular inference as a graph coloring problem, in: Workshop on Grammatical Inference, Automata Induction, and Language Acquisition (ICML'97), Nashville, TN, 1997.
26. F. Coste, J. Nicolas, How considering incompatible state mergings may reduce the DFA induction search tree, in: Fourth International Colloquium on Grammatical Inference (ICGI-98), Lecture Notes in Computer Science, vol. 1433, 1998, pp. 199-210.
27. O. Cicchello, S.C. Kremer, Beyond EDSM, in: Sixth International Colloquium on Grammatical Inference (ICGI-02), Lecture Notes in Computer Science, vol. 2484, Springer, Berlin, 2002, pp. 37-48.
28. J.P.M. Silva, and K. Sakallah GRASP - a new search algorithm for satisfiability Proceedings of the ACM/IEEE International Conference on Computer Aided Design 1996 IEEE Computer Society Press Silver Spring, MD 220 227
29. R.M. Stallman, and G.J. Sussman Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis Artif. Intell. 9 1977 135 196
30. H. Juillé, J.B. Pollack, A stochastic search approach to grammar induction, in: Fourth International Colloquium on Grammatical Inference (ICGI-98), Lecture Notes in Computer Science, vol. 1433, 1998, pp. 126-137.
31. K.J. Lang, Evidence-driven state merging with search, Technical Report TR98-139, NECI, 1998.
32. M. Bugalho Search methods for the inference of DFAs from samples of their behavior 2003 Private communication