For example,Бобцов

REPRESENTATION OF FINITE STATE AUTOMATA BY LINEAR BINARY GRAPHS IN GENETIC PROGRAMMING

Annotation

The article deals with representation of finite state automata by evolutionary algorithm individuals based on linear binary graphs. Comparison of the given method with known ones is done by the example. Suggested method is more efficient as compared with representation of transition function by complete charts. It is more efficient at some condition numbers than representation of transition function by decision trees.

Читать текст статьи

Keywords

Articles in current issue