Regular language induction with genetic programming   [GP]

by

Dunay, B., D., Petry, F., E. and Buckles, W., P.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Proceedings of the 1994 IEEE World Congress on Computational Intelligence (Conference proceedings), 1994, p. 396-400
Keywords:genetic algorithms, genetic programming
Notes:
Considers two classes of regular language (NB series and Tomita) which can be recognised or accpeted by deterministic finite automata (Finite state machines). Can translate from DFA to tree structure. Trees are not executable programs but represent languages. crossover on trees defined. GP able to define a language given examples of it. Works on simplier examples but has difficulties with 8b, 9b, 10b and TL5.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InProceedings{Dunay:1994:rliGP,
  author =       "B. D. Dunay and F. E. Petry and W. P Buckles",
  title =        "Regular language induction with genetic programming",
  booktitle =    "Proceedings of the 1994 IEEE World Congress on
                 Computational Intelligence",
  year =         "1994",
  pages =        "396--400",
  address =      "Orlando, Florida, USA",
  month =        "27-29 " # jun,
  publisher =    "IEEE Press",
  keywords =     "genetic algorithms, genetic programming",
  size =         "5 pages",
  notes =        "Considers two classes of regular language (NB series
                 and Tomita) which can be recognised or accpeted by
                 deterministic finite automata (Finite state machines).
                 Can translate from DFA to tree structure. Trees are not
                 executable programs but represent languages. crossover
                 on trees defined. GP able to define a language given
                 examples of it. Works on simplier examples but has
                 difficulties with 8b, 9b, 10b and TL5.",
}