| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1709643 | Applied Mathematics Letters | 2010 | 4 Pages |
Abstract
One of the key issues in symbolic dynamic filtering (SDF) is how to obtain a lower bound on the length of symbol blocks for computing the state probability vectors of probabilistic finite-state automata (PFSA). Having specified an absolute error bound at a confidence level, this short work formulates a stopping rule by making use of Markov chain Monte Carlo (MCMC) computations.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Yicheng Wen, Asok Ray,