Learning Restarting Automata by Genetic Algorithms
Petr Homann · 2002
Restarting automaton is a special type of a linear bounded automaton designed for modelling the so-called analysis by reduction. We use genetic algorithms to learn restarting automata to recognize lan- guages according to input consisting of sets of positive and negative ex- amples of words from the language together with positive and negative examples of simplifications.