Journal
Scientific and technical journal of information technologies, mechanics and optics
UDK004.4`242
Issue:2 (72)
Download PDF0 Kbyte
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.
AND ARTIFICIAL INTELLIGENCE TECHNOLOGIES GENERATION OF FINITE STATE MACHINES FOR UNMANNED AIRPLANE CONTROLLING