An efficient algorithm for estimating the state sequence of a finite state machine given an output sequence

We consider the problem of sequentially estimating the states of non-unifilar finite state machines on the basis of the output symbols of the machine and show that a Fano-type inequality can be effectively used as a stopping criterion. Lower and upper bounds on the decoding error probability are given.