Evolving deterministic finite automata using cellular encoding

  • Authors:
  • Scott Brave

  • Affiliations:
  • Stanford University, Stanford, California

  • Venue:
  • GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
  • Year:
  • 1996

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents a method for the evolution of deterministic finite automata that combines genetic programming and cellular encoding. Programs are evolved that specify actions for the incremental growth of a deterministic finite automata from an initial single-state zygote. The results show that, given a test bed of positive and negative samples, the proposed method is successful at inducing automata to recognize several different languages.