|Title:||Mutation Operators for the Evolution of Finite Automata|
|Abstract:||Evolutionary programming has originally been proposed for the breeding of finite state automata. The mutation operator is working directly on the graph structure of the automata. In this paper we introduce variation operators based on the automatons input/output behavior rather than its structure. The operators are designed to make use of additional information based on a ranking of states as well as a problem-specific metric which enhances the search process.|
|Appears in Collections:||Sonderforschungsbereich (SFB) 531|
Files in This Item:
|ci82.pdf||DNB||169.25 kB||Adobe PDF||View/Open|
This item is protected by original copyright
All resources in the repository are protected by copyright.