Grammatical Inference is a new branch of (symbolic) learning algorithms. In this field most of the algorithms infer automata or transducers from a set of examples. In this paper we propose an inference algorithm which infers the modification of an existing a transducer according to the examples of desired input/output pairs instead of inferring such a transducer from scratch. The paper evaluates the effectiveness of the algorithm by analyzing the inferred solutions of examples. The solutions of the algorithm are also compared to the results of a previously described inference algorithm. The comparison showed that the newly proposed algorithm behaved superior.
| Original language | English |
|---|
| Place of Publication | Hagenberg |
|---|
| Publisher | RISC, JKU |
|---|
| Number of pages | 38 |
|---|
| Publication status | Published - 2011 |
|---|
| Name | RISC Report Series |
|---|
| No. | 11-16 |
|---|
- 101001 Algebra
- 101002 Analysis
- 101 Mathematics
- 102 Computer Sciences
- 102011 Formal languages
- 101009 Geometry
- 101013 Mathematical logic
- 101020 Technical mathematics
- 101025 Number theory
- 101012 Combinatorics
- 101005 Computer algebra
- 101006 Differential geometry
- 101003 Applied geometry
- 102025 Distributed systems
- Computation in Informatics and Mathematics