Please use this identifier to cite or link to this item:
|A risk driven state merging algorithm for learning DFAs
|University of Malta. Faculty of ICT
|Spina, S. (2003). A risk driven state merging algorithm for learning DFAs. 1st Computer Science Annual Workshop (CSAW’03), Msida. 99-102.
|When humans efficiently infer complex functions from a relatively few but well- chosen examples, something beyond exhaustive search must probably be at work. Different heuristics are often made use of during this learning process in order to efficiently infer target functions. Our current research focuses on different heuristics through which regular grammars can be efficiently inferred from a minimal amount of examples. A brief introduction to the theory of grammatical inference is given, followed by a brief discussion of the current state of the art in automata learning and methods currently under development which we believe can improve automata learning when using sparse data.
|Appears in Collections:
|Scholarly Works - FacICTCS
Files in This Item:
|Proceedings of CSAW’03-A18.pdf
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.