Classes directable automata and application of GA in Automata Theory

Automata Theory is an exciting, theoretical branch of computer science. Automata theory deals with the logic of computation with respect to simple machines, referred to as automata. Automata are abstract models of machines that perform computations on an input by moving through a series of states or configurations. An automaton is a mathematical object that takes a word as input and decides either to accept it or reject it. Genetic algorithms are a family of algorithms that use some kind of gene-tic principles that are present in nature, in order to solve specific computational problems. GA have proved very powerful and also very general tool for solving problems in the field of learning in neural networks, in finding the shortest path, the traveling salesman problem, in strategy games, the problem of the deployment process, the problem of determining the parameters of the system, the optimization of queries on the database. One interesting, relatively new area of application of genetic algorithms is the theory of automata.