Full metadata record
DC FieldValueLanguage
dc.contributor.authorWiesmann, Dirkde
dc.date.accessioned2004-12-07T08:20:19Z-
dc.date.available2004-12-07T08:20:19Z-
dc.date.created2000de
dc.date.issued2001-10-16de
dc.identifier.urihttp://hdl.handle.net/2003/5386-
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-5638-
dc.description.abstractEvolutionary 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.extent173312 bytes-
dc.format.extent215283 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/postscript-
dc.language.isoende
dc.publisherUniversität Dortmundde
dc.relation.ispartofseriesReihe Computational Intelligence ; 82de
dc.subject.ddc004de
dc.titleMutation Operators for the Evolution of Finite Automataen
dc.typeTextde
dc.type.publicationtypereport-
dcterms.accessRightsopen access-
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
ci82.pdfDNB169.25 kBAdobe PDFView/Open
ci82.ps210.24 kBPostscriptView/Open


This item is protected by original copyright



This item is protected by original copyright rightsstatements.org