Mutation Operators for the Evolution of Finite Automata

dc.contributor.author	Wiesmann, Dirk	de
dc.date.accessioned	2004-12-07T08:20:19Z
dc.date.available	2004-12-07T08:20:19Z
dc.date.created	2000	de
dc.date.issued	2001-10-16	de
dc.description.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.	en
dc.format.extent	173312 bytes
dc.format.extent	215283 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.identifier.uri	http://hdl.handle.net/2003/5386
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-5638
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.relation.ispartofseries	Reihe Computational Intelligence ; 82	de
dc.subject.ddc	004	de
dc.title	Mutation Operators for the Evolution of Finite Automata	en
dc.type	Text	de
dc.type.publicationtype	report
dcterms.accessRights	open access
eldorado.dnb.deposit	true

Dateien

Gerade angezeigt 1 - 2 von 2