Solving Complex Problems with Genetic Algorithms   [GA]

by

Dunay, B., D. and Petry, F., E.

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: Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95) (Conference proceedings), 1995, p. 264-270
Keywords:Genetic Programming, Genetic Algorithms
Abstract:
Using GA to evolve Turing machines [TM] which recognise languages from the Chomsky heirarchy. Example for regular languages (awb), context free languages (a**nb**n) and context sensitive languages (a**nb**na**n).
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:1995:scpga,
  author =       "Bertrand Daniel Dunay and Frederic E. Petry",
  title =        "Solving Complex Problems with Genetic Algorithms",
  booktitle =    "Genetic Algorithms: Proceedings of the Sixth
                 International Conference (ICGA95)",
  year =         "1995",
  editor =       "L. Eshelman",
  pages =        "264--270",
  address =      "Pittsburgh, PA, USA",
  publisher_address = "San Francisco, CA, USA",
  month =        "15-19 " # jul,
  publisher =    "Morgan Kaufmann",
  keywords =     "Genetic Programming, Genetic Algorithms",
  ISBN =         "1-55860-370-0",
  size =         "7 pages",
  abstract =     "Using GA to evolve Turing machines which recognise
                 languages from the Chomsky heirarchy. Example for
                 regular languages (awb), context free languages
                 (a**nb**n) and context sensitive languages
                 (a**nb**na**n).",
}