论文信息 - Context-Free Language Induction by Evolution of Deterministic Push-Down Automata Using Genetic Programming<

Context-Free Language Induction by Evolution of Deterministic Push-Down Automata Using Genetic Programming<

The process of learning often consists of Inductive Inference, making generalizations from samples. The problem here is finding generalizations (Grammars) for Formal Languages from finite sets of positive and negative sample sentences. The focus of this paper is on Context-Free Languages (CFL’s) as defined Context-Free Grammars (CFG’s), some of which are accepted by Deterministic Push-Down Automata (D-PDA). This paper describes a meta-language for constructing D-PDA’s. This language is then combined with Genetic Programming to evolve D-PDA’s which accept languages. The technique is illustrated with two favorite CFL’s.

Afra Zomorodian | A. Zomorodian

[1] Raymond L. Watrous,et al. Induction of Finite-State Languages Using Second-Order Recurrent Networks , 1992, Neural Computation.

[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[3] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..

[4] J. K. Kinnear,et al. Advances in Genetic Programming , 1994 .

[5] Frédéric Gruau,et al. Genetic micro programming of neural networks , 1994 .

[6] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[7] C. Lee Giles,et al. Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks , 1992, Neural Computation.

[8] Frederick E. Petry,et al. Regular language induction with genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.