Comparing Finite State Automata Representation with GP-trees

Created by W.Langdon from gp-bibliography.bib Revision:1.3872

  author =       "Pavel Petrovic",
  title =        "Comparing Finite State Automata Representation with
  institution =  "Norwegian University of Science and Technology",
  year =         "2006",
  type =         "IDI Technical Report",
  number =       "04/06",
  address =      "Norway",
  ISSN =         "1503-416X",
  keywords =     "genetic algorithms, genetic programming, Evolutionary
                 Programming, Finite State Automata, Incremental
                 Evolution, SBSE",
  URL =          "",
  abstract =     "Genetic Programming and Evolutionary Programming are
                 fields studying the application of artificial evolution
                 on evolving directly executable programs, in form of
                 trees similar to Lisp expressions (GP-trees), or Finite
                 State Automata (FSA). In this exercise, we study the
                 performance of these methods on several example
                 problems, and draw conclusions on the suitability of
                 the representations with respect to the task structure
                 and properties. We investigate the role of incremental
                 evolution in the context of FSA representation. We also
                 present an evolutionary software package for
                 educational programming environment Imagine, which can
                 be used for introducing the principles of evolutionary
                 computing to wider young audience.",
  notes =        "cited by \cite{eurogp07:johnson}",
  size =         "43 pages",

Genetic Programming entries for Pavel Petrovic