Displaying similar documents to “Theory of stochastic automata”

Learning deterministic regular grammars from stochastic samples in polynomial time

Rafael C. Carrasco, Jose Oncina (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

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.