A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Learning deterministic regular grammars from stochastic samples in polynomial time
1999
RAIRO - Theoretical Informatics and Applications
In this paper, the identification of stochastic regular languages is addressed. For this purpose, we propose a class of algorithms which allow for the identification of the structure of the minimal stochastic automaton generating the language. It is shown that the time needed grows only linearly with the size of the sample set and a measure of the complexity of the task is provided. Experimentally, our implementation proves very fast for application purposes. Résumé. Dans cet article, onétudie
doi:10.1051/ita:1999102
fatcat:rw2vcb2qtnfo7ma5cns3dffuum