Skip to main content
SpringerLink
Log in

Application of genetic algorithms for automatic construction of finite-state automata in the problem of flibs

  • Artificial Intelligence
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

A genetic algorithm is proposed to solve the problem of flibs, which simulate the behavior of a simplest living being in a simplest environment. Computational experiments have been performed demonstrating the efficiency of this algorithm compared with the existing algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. A. Shalyto, “Technology of Automaton Programming,” Mir PK, No. 10, 74–78 (2003).

  2. M. Mitchell, An Introduction to Genetic Algorithms (MA: MIT Press, Cambridge, 1996).

    Google Scholar 

  3. W. Langdon and R. Poli, Better Trained Ants for Genetic Programming (University of Birmingham, Birmingham, 1998).

    Google Scholar 

  4. S. A. Wolfram, A New Kind of Science (Wolfram Media, Champaign, 2002).

    MATH  Google Scholar 

  5. M. Mitchell, J. Crutchfield, and P. Hraber, “Evolving Cellular Automata to Perform Computations,” Phys. D. (Amsterdam) 75, 361–391 (1993).

    Google Scholar 

  6. Yu. D. Bednyi, Application of Genetic Algorithms for Solving a Problem on Cell Automata. The Problem of Density Classification for Cellular Automata. Bachelor Thesis (SPbGU ITMO, St. Petersburg, 2006) [in Russian].

    Google Scholar 

  7. D. Whitley, “A Genetic Algorithm Tutorial,” Statistics and Computing 4, 65–85 (1994).

    Article  Google Scholar 

  8. O. Voronin and A. D’yudni, “Darwinism in Programming,” Moi Komp’yuter, No. 35 (2004).

  9. B. Miller and M. Goldberg, “Genetic Algorithms, Tournament Selection, and the Effects of Noise,” Complex Systems 3, 193–212 (1995).

    MathSciNet  Google Scholar 

  10. K. De Jong, An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD Thesis (Univ. of Michigan, Ann Arbor, 1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St.-Petersburg State University of Information Technologies, Mechanics, and Optics, ul. Sablinskaya 14, St. Petersburg, 197101, Russia

    P. G. Lobanov & A. A. Shalyto

Authors
  1. P. G. Lobanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Shalyto
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © P.G. Lobanov, A.A. Shalyto, 2007, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2007, No. 5, pp. 127–136.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lobanov, P.G., Shalyto, A.A. Application of genetic algorithms for automatic construction of finite-state automata in the problem of flibs. J. Comput. Syst. Sci. Int. 46, 792–801 (2007). https://doi.org/10.1134/S1064230707050115

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230707050115

Keywords

Search

Navigation