Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata
Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata
复制标题
DOI：
10.1007/978-3-540-45257-7_12
复制
发表时间：
2000-09
期刊：
影响因子：
--
通讯作者：
C. D. L. Higuera;F. Thollard
中科院分区：
文献类型：
--
作者：
C. D. L. Higuera;F. Thollard
The current formal proof that stochastic deterministic finite automata can be identified in the limit with probability one makes use of a simplified state-merging algorithm. We prove in this paper that theAlergiaalgorithm, and its extensions, which may use some blue fringe type of ordering, can also identify distributions generated by stochastic deterministic finite automata. We also give a new algorithm enabling us to identify the actual probabilities, even though in practice, the number of examples needed can still be overwhelming.
