Theory of stochastic automata
Peter H. Starke (1966)
Kybernetika
Similarity:
Peter H. Starke (1966)
Kybernetika
Similarity:
M. Métivier, J. Pellaumail (1976)
Publications mathématiques et informatique de Rennes
Similarity:
J. Gani (1966-1967)
Publications mathématiques et informatique de Rennes
Similarity:
Fabio Bagarello (2006)
Banach Center Publications
Similarity:
Sridharan, V., Kalyani, T.V. (2005)
APPS. Applied Sciences
Similarity:
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.