Learning DFA: Evolution versus evidence driven state merging

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 1, Issue , 2003, Pages 351-358

  Lucas, Simon M ^a   Reynolds, T Jeff ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; LEARNING ALGORITHMS;

DETERMINISTIC FINITE AUTOMATA; EVIDENCE DRIVEN STATE MERGING; EVIDENCE DRIVEN STATE MERGING ALGORITHMS; EVOLUTIONARY METHOD; FITNESS EVALUATIONS; SEARCH SPACES; TRAINING SETS; TRANSITION MATRICES;

CALCULATIONS;

EID: 84901466138     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299597     Document Type: Conference Paper

References (19)

1. P. J. Angeline, G. M. Saunders, and J. P. Pollack. An evolutionary algorithm that constructs recurrent neural networks. IEEE Transactions on Neural Networks. 5(1):54-65, January 1994.
2. H.-G, Beyer, Toward a theory of evolution strategies: The (mue. lambda)-theory. Evolutionary Computation, 2(4):381-407. 1994.
3. O. Cicchello and S. C. Kremer, Beyond EDSM. Lecture Notes in Computer Science, 2484:37-48, 2002.
4. P. Dupont. Regular grammatical inference from positive and negative samples by genetic search: The GIG method. In Ft. C. Carrasco and J. Oncina, editors, Grammatical Inference and Applications (ICGI-94), pages 236-245. Springer. Berlin. Heidelberg, 1994.
5. P. Dupont, L. Miclet, and E. Vidal. What is the search space of the regular inference? In R. C. Carrasco and J. Oncina. editors. Grammatical Inference and Applications (ICGI-94), pages 25-37. Springer. Berlin. Heidelberg, 1994.
6. C, Giles, G. Sun. H. Chen. Y. Lee. and D. Chen, Higher order recurrent neural networks and grammatical inference. In D, Touretzky, editor. Advances in Neural Information Processing Systems 2. Morgan Kaufman, San Mateo, CA, (1990).
7. H. Juille and J. B, Pollack. A sampling-based heuristic for tree search applied to grammar induction. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), Madison, Wisconsin. USA. 26-30 1998. AAAI Press Books.
8. M. Keams and L. G. Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. In Proceedings of ACM Symposium on Theory of Computation {STOC-89), pages 433-444, 1989.
9. K. J. Lang, B. A. Pearlmutter, and R. A. Price. Results of the Abbadingo One DFA learning competition and a new evidence-driven state merging algorithm. Lecture Notes in Computer Science. 1433:1-12, 1998.
10. S, M. Lucas. Evolving finite state transducers: Some initial explorations. In Proceedings of 6th European Conference on Genetic Programming, pages 130-141, 2003.
11. S. Luke. S. Hamahashi, and H. Kitano. "Genetic" Programming. In W. Banzhaf etal. editor, GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference. Morgan Kaufmann. 1999.
12. M. Mitchell. J. Holland, and S. Forrest. When will a genetic algorithm outperform hill climbing? In J. Cowan, G, Tesauro, and J, Alspector. editors. Advances in Neural Information Processing Systems 6, pages 51-58, Morgan Kaufman. San Mateo. CA, 1994.
13. A. L. Oliveira and J. P. M. Silva. Efficient search techniques for the inference of minimum size finite automata. In String Processing and Information Retrieval, pages 81-89, 1998.
14. L. Pitt and M. Warmuth. The minimum consistent DFA problem cannot be approximated within any polynomial. Journal of the ACM. 40 (1). 1993.
15. R. Poli. A simple but theoretically-motivated method to control bloat in genetic programming. In Proceedings of 6th European Conference on Genetic Programming, pages 204-217. 2003.
16. J. D. Schaffer, D, Whitley, and L. J. Eshelman. Combinations of genetic algorithms and neural networks: a survey of the state of the art. In D. Whitley and J. D. Schaffer, editors. COGANN-92. Int. Workshop on Combinations of Genetic Algorithms and Neural Networks, pages 1-37. IEEE Computer Society, 1992.
17. M. Tomita. Dynamic construction of finite automata from examples using hill climbing. In Proc. of the 4th Annual Cognitive Science Conference, USA. pages 105-108. 1982.
18. B. A. Trakhtenbrot and Y. M. Barzdin. Finite Automata. North-Holland, Amsterdam. 1973.
19. R. Watrous and G. Kuhn. Induction of finite-state automata using second-order recurrent networks. In J. Moody, S. Hanson. and R. Lippmann, editors, Advances in Neural Information Processing Systems 4, pages 309-316. Morgan Kaufman, San Mateo, CA. 1992.