APPLICATION OF GENETIC ALGORTIHMS FOR MOORE AUTOMATA AND SYSTEMS OF MEALY AUTOMATA CONSTRUCTION IN “ARTIFICIAL ANT” PROBLEM

Dmitry Sokolov, Fedor Tsarev, Andrey Davydov

2008 , VOLUME 08, NUMBER 8 ( April )

ISSN 2226-1494 (print), ISSN 2500-0373 (online)

Publications

Editor-in-Chief

Nikiforov
Vladimir O.
D.Sc., Prof.

Partners

APPLICATION OF GENETIC ALGORTIHMS FOR MOORE AUTOMATA AND SYSTEMS OF MEALY AUTOMATA CONSTRUCTION IN “ARTIFICIAL ANT” PROBLEM

D. Sokolov, F. Tsarev, A. Davydov

Read the full article

Abstract

A genetic algorithm for constructing Moore finite state machines is proposed in this paper. The same algorithm can be used for constructing systems of interaction Mealy finite state machines. For these types of automata genetic operations of mutation and cross-over were developed. Genetic algorithms are implemented with Java programming language. Application of these algorithms is illustrated on the example of “Artificial Ant” problem.

Keywords: genetic algorithm, Moore finite state machine, Mealy finite state machine, automata-based programming

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License