Genetic algorithm for induction of finite automata with continuous and discrete output actions

Abstract

In this paper, we describe a genetic algorithm for induction of finite automata with continuous and discrete output actions. Input data for the algorithm is a set of tests. Each test consists of two sequences: input events and output actions. In previous works output actions were discrete, i.e. selected from the finite set, in this work output actions can… (More)
DOI: 10.1145/2001858.2002089

2 Figures and Tables

Topics

  • Presentations referencing similar topics