A Merging States Algorithm for Inference of RFSAs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4201)
The aim of this paper is to present MRIA, a new merging states algorithm for inference of Residual Finite State Automata.
KeywordsPositive Sample Formal Language Target Language Input Sample Regular Language
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
© Springer-Verlag Berlin Heidelberg 2006